Description
Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST.
Basically, the deletion can be divided into two stages:
- Search for a node to remove.
- If the node is found, delete the node.
Note: Time complexity should be O(height of tree).
Example:
root = [5,3,6,2,4,null,7]
key = 3
5
/ \
3 6
/ \ \
2 4 7
Given key to delete is 3. So we find the node with value 3 and delete it.
One valid answer is [5,4,6,2,null,null,7], shown in the following BST.
5
/ \
4 6
/ \
2 7
Another valid answer is [5,2,6,null,4,null,7].
5
/ \
2 6
\ \
4 7
问题描述
给定二叉排序树的根节点和一个键, 删除树中对应键的节点。返回二叉排序树的根节点(可能会更新)
一般, 删除可以分为两部分:
- 找出删除的节点
- 删除节点
问题分析
找出删除节点, 若其左子树或右子树为空, 那么直接返回删除节点的右子树或者左子树, 否则将删除节点的左子树作为删除节点的右子树的最左节点的左子树, 返回删除节点的右子树的根节点
解法
class Solution {
public TreeNode deleteNode(TreeNode root, int key) {
if(root == null) return null;
if(root.val > key){
root.left = deleteNode(root.left, key);
}else if(root.val < key){
root.right = deleteNode(root.right, key);
}else{
if(root.left == null) return root.right;
else if(root.right == null) return root.left;
else{
TreeNode leftMostNodeOfRight = toolFunc(root.right);
leftMostNodeOfRight.left = root.left;
return root.right;
}
}
return root;
}
public TreeNode toolFunc(TreeNode root){
while(root.left != null) root = root.left;
return root;
}
}