235. 二叉搜索树的最近公共祖先 - 力扣(LeetCode)
思路:可以看做特殊的普通二叉树的最近公共祖先解题思路,通过递归左右子树,当左子节点不为空且右节点不为空,则返回祖先节点
代码:
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root == nullptr) return nullptr;
if(root == p || root == q) return root;
TreeNode* left = lowestCommonAncestor(root->left,p,q);
TreeNode* right = lowestCommonAncestor(root->right,p,q);
if(left != nullptr && right != nullptr) return root;
return left != nullptr ? left : right;
}
};
701. 二叉搜索树中的插入操作 - 力扣(LeetCode)
思路:先通过递归找到需要插入节点的祖先节点,然后通过指针比较新插入的节点值和该祖先节点的大小,若是新插入的节点更大就插入到右边否则就左边
代码:
class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val) {
if(root == nullptr)
{
root = new TreeNode(val);
return root;
}
TreeNode* node = root,*pre = nullptr;
while(node != nullptr)
{
if(node->val == val) return nullptr;
pre = node;
if(node->val > val)
{
node = node->left;
}
else if(node->val < val)
{
node = node->right;
}
}
TreeNode* cur = new TreeNode(val);
if(pre->val > val) pre->left = cur;
else if(pre->val < val) pre->right = cur;
return root;
}
};