285. 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.

链接： http://leetcode.com/problems/inorder-successor-in-bst/

5/11/2017

自己没做好，思路是对的，但是没有想好如果碰到匹配该怎么办，尝试着退出。其实碰到匹配的话应该继续走右子树，然后找右子树里面的最左边的点。

public class Solution {
    public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
        if (root == null || p == null) return null;

        TreeNode tmp = null;
        TreeNode node = root;
        
        while (node != null) {
            if (p.val < node.val) {
                tmp = node;
                node = node.left;
            } else {
                node = node.right;
            }
        }
        return tmp;
    }
}

更多讨论：

https://discuss.leetcode.com/topic/25076/share-my-java-recursive-solution