willshine19的专栏

[LintCode]Insert Node in a Binary Search Tree /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val)

[LintCode]Remove Node in Binary Search Tree /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *

[LintCode]Validate Binary Search Tree /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *

[LintCode]Inorder Successor in BST public class Solution { /** * @param A: An integer array * @param target: An integer * @return : An integer which is the index of the target numb

[LintCode]Search Range in Binary Search Tree VERSION I /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(i

[LintCode]Convert Sorted List to Binary Search Tree /** * Definition for ListNode. * public class ListNode { * int val; * ListNode next; * ListNode(int val) { * this.val =