Leetcode

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) {
         TreeNode res = null;
         while(root!=null){
             if(root.val<=p.val){
                 root = root.right;
             }
             else if(root.val>p.val){
                 res = root;
                 root = root.left;
             }
             
         }
     return res;
    }
}