剑指 Offer II 053. 二叉搜索树中的中序后继
【分析】根据BST的性质,如果root.val <= p.val,说明后继肯定在右子树,去右子树找就行了,否则,root是后继,但是不一定是最小的后继,所以还要去left找。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
TreeNode ans = null;
while(root != null){
if(root.val <= p.val) root = root.right;
else{
ans = root;
root = root.left;
}
}
return ans;
}
}
【改进】如果p的右子树不为空,那么直接去p右边找就行了。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
TreeNode ans = null;
if(p.right != null){
p = p.right;
while(p != null){
ans = p;
p = p.left;
}
}else{
while(root != null){
if(root.val <= p.val) root = root.right;
else{
ans = root;
root = root.left;
}
}
}
return ans;
}
}