Karteikarten
Delete Node in a BST
Karten in diesem Stapel (1)
- 1Delete Node in a BSTclass Solution {
public TreeNode deleteNode(TreeNode root, int key) {
if(root == null) return root;
if(key < root.val){
root.left = deleteNode(root.left,key);
}else if(key > root.val){
root.right = deleteNode(root.right, key);
}else{
if(root.left == null) return root.right;
else if(root.right == null) return root.left;
TreeNode minNode = findMin(root.right);
root.val = minNode.val;
root.right = deleteNode(root.right, root.val);
}
return root;
}
private TreeNode findMin(TreeNode node){
while(node.left!=null) node = node.left;
return node;
}
}
Informationen
- Beschreibung
- Karteikarten am Delete Node in a BST, erstellt von Suhas S am 16/02/2018.
- Erstellt von
- Suhas S
- Aufrufe
- 9
- Tags
- Bewertung