235. 二叉搜索树的最近公共祖先 - 力扣(Leetcode)
要理解最近公共祖先一定第一次出现在[p.q]中
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);
}
else if (root->val<p->val&&root->val<q->val)
{
return lowestCommonAncestor(root->right,p,q);
}
else
return root;
}
};
701. 二叉搜索树中的插入操作 - 力扣(Leetcode)
class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val) {
if(root==NULL)
{
TreeNode*node=new TreeNode(val);
return node;
}
if(root->val>val)
root->left=insertIntoBST(root->left,val);
if(root->val<val)
root->right=insertIntoBST(root->right,val);
return root;
}
};
450. 删除二叉搜索树中的节点 - 力扣(Leetcode)
class Solution {
public:
TreeNode* deleteNode(TreeNode* root, int key) {
if(root==NULL)
return root;
if(root->val>key)
root->left=deleteNode(root->left,key);
else if(root->val<key)
root->right=deleteNode(root->right,key);
else
{
TreeNode* temp=root->left;
if(root->right==NULL)
root=temp;
else
{
root=root->right;
TreeNode* cur=root;
while(cur->left)
{
cur=cur->left;
}
cur->left=temp;
}
}
return root;
}
};