-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtrees.java
161 lines (82 loc) · 2.09 KB
/
trees.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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
/* package codechef;
// don't place package name!
*/
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
class trees
{
Node root;
public void insert(int key){
root = insert(root,key);
}
private Node insert(Node n, int key){
if(n == null) return new Node(key);
if(n.key == key){}
if(key < n.key){
n.left = insert(n.left,key);
}
else n.right = insert(n.right,key);
return n;
}
public boolean search(int key){
return search(root,key);
}
private boolean search(Node n,int key){
if(n == null) return false;
if(n.key == key) return true;
if(n.key > key) return search(n.left,key);
return search(n.right,key);
}
public int getmin(){
if(root == null) return -1;
return getmin(root);
}
private int getmin(Node n){
if(n.left == null) return n.key;
return getmin(n.left);
}
public int getmax(){
if(root == null) return -1;
return getmax(root);
}
private int getmax(Node n){
if(n.right == null) return n.key;
return getmax(n.right);
}
public void delmin(){
root = delmin(root);
}
private Node delmin(Node n){
if(n.left == null) return n.right;
n.left = delmin(n.left);
return n;
}
public static void main (String[] args) throws java.lang.Exception
{
// your code goes here
trees b = new trees();
b.insert(5);
b.insert(3);
b.insert(4);
b.insert(2);
b.insert(7);
b.insert(6);
b.insert(8);
System.out.println(b.search(5));
System.out.println(b.search(9));
System.out.println(b.getmax());
System.out.println(b.getmin());
}
class Node{
int key;
Node right;
Node left;
public Node(int key){
this.key = key;
this.left = null;
this.right = null;
}
}
}