Leetcode: Inorder Successor in BST

Given a binary search tree and a node in it, find the in-order successor of that node in the BST.

Note: If the given node has no in-order successor in the tree, return null.

网上看到更好的方法：https://leetcode.com/discuss/77805/java-5ms-short-code-with-explanations 

The idea is to compare root's value with p's value if root is not null, and consider the following two cases:

• root.val > p.val. In this case, root can be a possible answer, so we store the root node first and call it res. However, we don't know if there is anymore node on root's left that is larger than p.val. So we move root to its left and check again.

• root.val <= p.val. In this case, root cannot be p's inorder successor, neither canroot's left child. So we only need to consider root's right child, thus we move root to its right and check again.

We continuously move root until exhausted. To this point, we only need to return the res in case 1.

public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
    TreeNode res = null;
    while(root!=null) {
        if(root.val > p.val) {
            res = root;
            root = root.left;
        }
        else root = root.right;
    }
    return res;
}

 

算Predecessor in BST也是类似的

public TreeNode inorderPrecessor(TreeNode root, TreeNode p) {
    TreeNode res = null;
    while (root != null) {
        if (root.val < p.val) {
            //root could be p's predecessor, but we don't know if there's one in root.right 
            //that is even closer to p. 
            res = root;
            root = root.right;
        }
        else { //root could not be p's predecessor
            root = root.left;
        }
    }
    return res;
}

 

Recursion: use Inorder traversal

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
        ArrayList<TreeNode> prev = new ArrayList<TreeNode>();
        ArrayList<TreeNode> res = new ArrayList<TreeNode>();
        prev.add(null);
        res.add(null);
        inorder(root, p, prev, res);
        return res.get(0);
    }
    
    public void inorder(TreeNode root, TreeNode p, ArrayList<TreeNode> prev, ArrayList<TreeNode> res) {
        if (root == null) return;
        inorder(root.left, p, prev, res);
        if (prev.get(0) == p) {
            res.set(0, root);
        }
        prev.set(0, root);
        inorder(root.right, p, prev, res);
    }
}