235. 二叉搜索树的最近公共祖先
题目链接/文章讲解:代码随想录
递归
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root.val > p.val && root.val > q.val) return lowestCommonAncestor(root.left, p, q);
if(root.val < p.val && root.val < q.val) return lowestCommonAncestor(root.right, p, q);
return root;
}
}
迭代
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
while(true) {
if(root.val > p.val && root.val > q.val) root = root.left;
else if(root.val < p.val && root.val < q.val) root = root.right;
else break;
}
return root;
}
}
有个错误示范,break导致只循环一次就退出
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
while(true) {
if(root.val > p.val && root.val > q.val) root = root.left;
if(root.val < p.val && root.val < q.val) root = root.right;
break;
}
return root;
}
}
701.二叉搜索树中的插入操作
题目链接/文章讲解:代码随想录
遇到空节点说明此节点是插入的位置
class Solution {
public TreeNode insertIntoBST(TreeNode root, int val) {
if(root == null) return new TreeNode(val);
if(root.val > val) root.left = insertIntoBST(root.left, val);
if(root.val < val) root.right = insertIntoBST(root.right,val);
return root;
}
}
450.删除二叉搜索树中的节点
题目链接/文章讲解:代码随想录
迭代
class Solution {
public TreeNode deleteNode(TreeNode root, int key) {
if(root == null) return null;//终止条件
if(root.val == key) {//当节点值等于key时 分情况讨论
if(root.left == null) {//左节点为空时,将右节点返回给上一级,覆盖掉root
return root.right;
} else if(root.right == null) {//同理
return root.left;
} else {//当左右节点都不为null时 将root.left赋给右子树最左边的左节点 将root.right返回上一级
//因为二叉搜索树的特性 右子树一定大于左子树
TreeNode cur = root.right;
while(cur.left != null) {
cur = cur.left;
}
cur.left = root.left;
root = root.right;
return root;
}
}
if(root.val > key) root.left = deleteNode(root.left, key);//左子树
if(root.val < key) root.right = deleteNode(root.right, key);//右子树
return root;
}
}