-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBST.java
More file actions
148 lines (101 loc) · 2.03 KB
/
BST.java
File metadata and controls
148 lines (101 loc) · 2.03 KB
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
136
137
138
139
140
141
142
143
144
145
146
147
148
package binarySearchTree;
public class BST {
class Node{
int data;
Node left;
Node right;
}
private Node root;
public BST( int arr[]) {
this.root = construct(arr, 0 , arr.length -1 );
}
private Node construct( int arr[] , int lo , int hi) {
if(lo > hi) {
return null;
}
int mid = (lo+ hi)/2;
// create node
Node nn = new Node();
nn.data = arr[mid];
nn.left = construct(arr, lo, mid-1);
nn.right = construct(arr, mid+1 ,hi);
return nn;
}
public void display() {
this.display(this.root);
}
private void display(Node node) {
if(node == null) {
return ;
}
String str = "";
if(node.left == null) {
str= "."+str;
}
else {
str = node.left.data +str;
}
str = str +" => "+ node.data+" <= " ;
if(node.right == null) {
str = str+ ".";
}
else {
str= str + node.right.data;
}
System.out.println(str);
display(node.left);
display(node.right);
}
public void search(int data) {
this.search(this.root, data);
}
private void search(Node node, int data) {
if(node == null) {
System.out.println("data doesn't exist");
return;
}
if( node.data == data) {
System.out.println("Data Found");
return ;
}
if( node.data > data) {
search(node.left , data);
}
if(node.data < data) {
search(node.right , data);
}
}
public void findmax() {
System.out.println(this.findmax(this.root));
}
private int findmax(Node node) {
if(node.right == null ) {
return node.data;
}
return findmax(node.right);
}
/*Adding a node in BST */
public void add( int data) {
this.add( this.root , data);
}
private void add( Node node , int item) {
if( item > node.data) {
if(node.right == null) {
Node nn = new Node();
nn.data = item;
node.right = nn;
}
else {
add(node.right, item);
}
}else {
if(node.left == null) {
Node nn = new Node();
nn.data = item;
node.left = nn;
}else {
add(node.left , item);
}
}
}
}