LeetCode 285. Inorder Successor in BST

原题链接在这里：https://leetcode.com/problems/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.

题解：

successor could be自己的parent, or 右子树中最左的点.

For both cases, if p.val < root.val, update successor as root. Otherwise, root needs to be bigger, root = root.right.

Time Complexity: O(h).

Space: O(1).

AC Java:

 1 /**
 2  * Definition for a binary tree node.
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 public class Solution {
11     public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
12         if(root == null || p == null){
13             return null;
14         }
15         TreeNode successor = null;
16         while(root != null){
17             if(p.val < root.val){
18                 successor = root;
19                 root = root.left;
20             }else{
21                 root = root.right;
22             }
23         }
24         return successor;
25     }
26 }

跟上Inorder Successor in BST II.

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/5206006.html