235. 二叉搜索树的最近公共祖先
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root==null) return root;
if(root.val>=p.val&&root.val<=q.val) return root;
if(root.val>=q.val&&root.val<=p.val) return root;
if(root.val>q.val&&root.val>p.val){
return lowestCommonAncestor(root.left,p,q);
}
if(root.val<q.val&&root.val<p.val){
return lowestCommonAncestor(root.right,p,q);
}
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){
if(root.left!=null&&root.right!=null){
TreeNode cur = root.right;
while (cur.left != null) {
cur = cur.left;
}
cur.left = root.left;
root = root.right;
return root;
}
else if(root.left==null) return root.right;
else if(root.right==null) return root.left;
}
if(root.val>key) root.left=deleteNode(root.left,key);
else if(root.val<key) root.right=deleteNode(root.right,key);
return root;
}
}