-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDeleteANodeFromBST.java
47 lines (32 loc) · 1.1 KB
/
DeleteANodeFromBST.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
// Deleting a Node from BST
public TreeNode findMax(TreeNode root)
{
if(root==null) return null;
if(root.right!=null) return findMax(root.right);
else return root;
}
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 && root.right!=null)
{
TreeNode max= findMax(root.left);
root.val=max.val;
root.left=deleteNode(root.left,max.val);
return root;
}else if(root.left!=null){
return root.left;
}else if(root.right!=null){
return root.right;
}else{
return null;
}
}
return root;
}