Java/BST.java at main · gulafsh/Java · GitHub

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
publicclassBST {
classNode {
intkey;
Nodeleft, right;

publicNode(intitem) {
key = item;
left = right = null;
 }
 }

privateNoderoot;

publicBST() {
root = null;
 }

publicvoidinsert(intkey) {
if (root == null) {
root = newNode(key);
 } else {
insertnode(this.root, key);
 }
 }

publicNodeinsertnode(Noderoot, intkey) {
if (root == null) {
root = newNode(key);
returnroot;
 } elseif (key < root.key) {
root.left = insertnode(root.left, key);
 } else {
root.right = insertnode(root.right, key);
 }
returnroot;
 }

publicNodedeletenode(Noderoot, intk) {

if (root == null)
returnroot;
if (root.key > k) {
root.left = deletenode(root.left, k);
returnroot;
 } elseif (root.key < k) {
root.right = deletenode(root.right, k);
returnroot;
 }
if (root.left == null) {
Nodetemp = root.right;
returntemp;
 } elseif (root.right == null) {
Nodetemp = root.left;
returntemp;
 } else {
NodesuccParent = root;
Nodesucc = root.right;
while (succ.left != null) {
succParent = succ;
succ = succ.left;
 }
if (succParent != root)
succParent.left = succ.right;
else
succParent.right = succ.right;
root.key = succ.key;
returnroot;
 }
 }

publicvoidInorder() {
Inorderrec(this.root);
 }

publicvoidInorderrec(Noderoot) {
if (root != null) {
Inorderrec(root.left);
System.out.print(root.key + " ");
Inorderrec(root.right);
 }
 }

publicstaticvoidmain(String[] args) {
BSTb = newBST();
b.insert(10);
b.insert(12);
b.insert(1);
b.insert(100);
System.out.println("Before Delete");
b.Inorder();
b.deletenode(b.root, 12);
System.out.println();
System.out.println("After Delete");
b.Inorder();
 }
}