week 3 285. Inorder Successor in BST

/**
 * 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) {
        if (root == null){
            return null;
        }
        if(p.val < root.val){
            TreeNode left == inorderSuccessor(root.left, p);
            return left == null ? root : left;
        }else{
            return inorderSuccessor(root.right, p);
        }
    }
}