-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbst.java
More file actions
78 lines (75 loc) · 2.04 KB
/
bst.java
File metadata and controls
78 lines (75 loc) · 2.04 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
public class bst {
Node root;
class Node{
int value;
Node left;
Node right;
Node(int value){
this.value=value;
}
}
public boolean insert(int value){
Node newnode=new Node(value);
if(root ==null){
root=newnode;
return true;
}
Node temp=root;
while(true){
if(newnode.value==temp.value)
return false;
if(newnode.value<temp.value){
if(temp.left==null){
temp.left=newnode;
return true;
}
temp=temp.left;
}
else{
if(temp.right==null){
temp.right=newnode;
return true;
}
temp=temp.right;
}
}
}
public boolean contains(int value){
Node temp=root;
while(temp!=null){
if(value<temp.value)
temp=temp.left;
else if(value>temp.value)
temp=temp.right;
else
return true;
}
return false;
}
public boolean rContains(Node currentnode,int value){
if(currentnode==null)
return false;
if(currentnode.value==value)
return true;
else if(currentnode.value>value)
return rContains(currentnode.left, value);
else
return rContains(currentnode.right,value);
}
public boolean check(int val){
return rContains(root, val);
}
public static void main(String args[]){
bst mybst=new bst();
System.out.println("Root: "+mybst.root);
mybst.insert(7);
mybst.insert(4);
mybst.insert(9);
mybst.insert(6);
System.out.println(mybst.root.left.right.value);
System.out.println(mybst.contains(6));
System.out.println(mybst.contains(8));
System.out.println(mybst.check(6));
System.out.println(mybst.check(8));
}
}