1.二叉搜索树的最近公共祖先
1.1 题目
. - 力扣(LeetCode)
1.2 题解
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q)
{
return Traversal(root, p, q);
}
TreeNode* Traversal(TreeNode* node, TreeNode* p, TreeNode* q)
{
//确定递归终止条件
if (node == nullptr)return nullptr;
if (node->val > p->val && node->val > q->val)
{
TreeNode* left = Traversal(node->left, p, q);
if (left != nullptr)
{
return left;
}
}
if (node->val < p->val && node->val < q->val)
{
TreeNode* right = Traversal(node->right, p, q);
if (right != nullptr)
{
return right;
}
}
return node;
}
};
2.二叉搜索树中的插入操作
2.1 题目
. - 力扣(LeetCode)
2.2 题解
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* insertIntoBST(TreeNode* root, int val)
{
//确定递归终止条件
if (root == nullptr)
{
TreeNode* node = new TreeNode(val);
return node;
}
//确定单层递归逻辑
if (val > root->val)
{
root->right = insertIntoBST(root->right,val);
}
if (val < root->val)
{
root->left = insertIntoBST(root->left, val);
}
return root;
}
};
3.删除二叉搜索树中的节点
3.1 题目
. - 力扣(LeetCode)
3.2 题解
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* deleteNode(TreeNode* root, int key)
{
//确定终止条件
//情况1:没找到
if (root == nullptr)return nullptr;
if (root->val == key)
{
//情况2:找到了,并且在叶子节点
if (root->left == nullptr && root->right == nullptr)
{
return nullptr;
}
//情况3:找到了,左节点为空,右节点不为空
else if (root->left == nullptr && root->right != nullptr)
{
return root->right;
}
//情况4:找到了,右节点为空,左节点不为空
else if (root->left != nullptr && root->right == nullptr)
{
return root->left;
}
//情况5:找到了,左右节点都不为空
else
{
//定义一个指针
TreeNode* cur = root->right;
while (cur->left!=nullptr)
{
cur = cur->left;
}
cur->left = root->left;
return root->right;
}
}
if (root->val > key)
{
root->left = deleteNode(root->left, key);
}
if (root->val < key)
{
root->right = deleteNode(root->right, key);
}
return root;
}
};