235. 二叉搜索树的最近公共祖先
题目链接:235. 二叉搜索树的最近公共祖先 - 力扣(LeetCode)
递归:
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root == null || mid(p.val, q.val, root.val)) {
return root;
}
return p.val > root.val ? lowestCommonAncestor(root.right, p, q) : lowestCommonAncestor(root.left, p, q);
}
private boolean mid(int a, int b ,int mid) {
return (a >= mid && b <= mid) || (a <= mid && b >= mid);
}
}
非递归:
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 {
return root;
}
}
}
}
701.二叉搜索树中的插入操作
题目链接:701. 二叉搜索树中的插入操作 - 力扣(LeetCode)
class Solution {
public TreeNode insertIntoBST(TreeNode root, int val) {
TreeNode ans = root;
if(root == null) {
return new TreeNode(val);
}
while(true) {
if(root.val > val) {
if(root.left != null) {
root = root.left;
}else {
root.left = new TreeNode(val);
return ans;
}
}else {
if(root.right != null) {
root = root.right;
}else {
root.right = new TreeNode(val);
return ans;
}
}
}
}
}
450.删除二叉搜索树中的节点
题目链接:450. 删除二叉搜索树中的节点 - 力扣(LeetCode)
递归:
class Solution {
public TreeNode deleteNode(TreeNode root, int key) {
if(root == null) {
return null;
}
if(root.val > key) {
root.left = deleteNode(root.left, key);
return root;
}else if(root.val < key) {
root.right = deleteNode(root.right, key);
return root;
}else {
if(root.left == null) {
return root.right;
}
if(root.right == null) {
return root.left;
}
TreeNode a = root.right;
while(a.left != null) {
a = a.left;
}
root.right = deleteNode(root.right, a.val);
a.left = root.left;
a.right = root.right;
return a;
}
}
}