/**
* 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) {
if(!root) return root;
if(root->val == key) {
if(!root->left || !root->right) root = (root->left) ? root->left : root->right;
else {
TreeNode* min_node = root->right;
while(min_node->left) min_node = min_node->left;
root->val = min_node->val;
root->right = deleteNode(root->right, min_node->val);
}
}
else if(root->val > key) root->left = deleteNode(root->left, key);
else root->right = deleteNode(root->right, key);
return root;
}
};
【leetcode 二叉树 C++】450. Delete Node in a BST
最新推荐文章于 2022-12-09 12:13:36 发布