文章目录
Question
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/successor-lcci/
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
Ideas
1、Answer( Java ) - BST二叉搜索树中序遍历
解法思路:BST二叉搜索树中序遍历
👍注意区分 push()
方法以及 offer()
方法
⚡️ push(E e)
将该元素插入到此 deque
的前面
(此方法相当于 addFirst(E)
)
⚡️ offer(E e)
在此 deque
的末尾
插入指定的元素(此方法相当于 offerLast(E)
)
Code
/**
* @author Listen 1024
* @description 面试题 04.06. 后继者( BST二叉搜索树中序遍历 + BST二叉搜索树性质 + 递归 )
* @date 2022-05-16 13:55
*/
class Solution {
public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
Deque<TreeNode> stack = new ArrayDeque<TreeNode>();
TreeNode prev = null, curr = root;
while (!stack.isEmpty() || curr != null) {
while (curr != null) {
stack.push(curr);
curr = curr.left;
}
curr = stack.pop();
if (prev == p) {
return curr;
}
prev = curr;
curr = curr.right;
}
return null;
}
}
2、Answer( Java ) - BST二叉搜索树性质
解法思路:BST二叉搜索树性质
Code
/**
* @author Listen 1024
* @description 面试题 04.06. 后继者( BST二叉搜索树中序遍历 + BST二叉搜索树性质 + 递归 )
* @date 2022-05-16 13:55
*/
class Solution {
public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
TreeNode res = null;
while (p.right != null) {
res = p.right;
while (res.left != null) {
res = res.left;
}
return res;
}
TreeNode node = root;
while (node != null) {
if (node.val > p.val) {
res = node;
node = node.left;
} else {
node = node.right;
}
}
return res;
}
}
3、Answer( Java ) - BST二叉搜索树性质 + 递归
解法思路:BST二叉搜索树性质 + 递归
Code
/**
* @author Listen 1024
* @description 面试题 04.06. 后继者( BST二叉搜索树中序遍历 + BST二叉搜索树性质 + 递归 )
* 时间复杂度 O(n)
* 空间复杂度 O(1)
* @date 2022-05-16 13:55
*/
class Solution {
public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
if (root == null) {
return null;
}
if (root.val <= p.val) {
return inorderSuccessor(root.right, p);
}
TreeNode res = inorderSuccessor(root.left, p);
return res == null ? root : res;
}
}
//部分题解参考链接(如侵删)
https://leetcode.cn/problems/successor-lcci/solution/hou-ji-zhe-by-leetcode-solution-6hgc/
https://leetcode.cn/problems/successor-lcci/solution/by-ac_oier-xib5/