-
Notifications
You must be signed in to change notification settings - Fork 2
/
DeleteNodeBinarySearchTree.java
135 lines (90 loc) · 2.35 KB
/
DeleteNodeBinarySearchTree.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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
public class DeleteNodeBinarySearchTree {
class Node {
int data;
Node left;
Node right;
}
public Node insert(Node node, int data) {
if (node == null) {
return createNewNode(data);
}
if (data < node.data) {
node.left = insert(node.left, data);
}
if (data > node.data) {
node.right = insert(node.right, data);
}
return node;
}
public Node createNewNode(int data) {
Node node = new Node();
node.left = null;
node.right = null;
node.data = data;
return node;
}
public Node deleteNonRecursive(Node root, int data) {
if (root == null) {
return root;
}
Node parent = null;
while (root.data != data && root != null) {
if (data < root.data) {
parent = root;
root = root.left;
}
if (data > root.data) {
parent = root;
root = root.right;
}
if (root.data == data) {
if (root.left != null && root.right == null) {
root = root.left;
} else if (root.left == null && root.right != null) {
root = root.right;
} else if (root.left == null && root.right == null) {
parent.left = null;
parent.right = null;
root = null;
break;
} else if (root.left != null && root.right != null) {
parent.left = root.left;
Node node = largestNodeOnOneDownRightSubTree(root.left);
node.right = root.right;
root = null;
break;
}
}
}
return root;
}
public Node largestNodeOnOneDownRightSubTree(Node root) {
if (root.right == null) {
return root;
}
return largestNodeOnOneDownRightSubTree(root.right);
}
public void inOrder(Node root) {
if (root == null) {
return;
}
inOrder(root.left);
System.out.print(root.data + " ");
inOrder(root.right);
}
public static void main(String[] args) {
DeleteNodeBinarySearchTree opr = new DeleteNodeBinarySearchTree();
Node root = null;
root = opr.insert(root, 8);
root = opr.insert(root, 3);
root = opr.insert(root, 6);
root = opr.insert(root, 10);
root = opr.insert(root, 4);
root = opr.insert(root, 7);
root = opr.insert(root, 1);
root = opr.insert(root, 14);
root = opr.insert(root, 13);
opr.deleteNonRecursive(root, 3);
opr.inOrder(root);
}
}