File size: 1,179 Bytes
c574d3a |
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 |
class BST{
static Node root;
static class Node{
int data;
Node left;
Node right;
Node(int d){
data = d;
left = null;
right = null;
}
}
// Iterative insert
void Insert(int x){
Node t = root;
Node p;
Node r = null;
if(root==null){
p = new Node(x);
root = p;
return;
}
while(t!=null){
r = t;
if(x<t.data){
t= t.left;
}
else if(x>t.data){
t = t.right;
}
else{
return;
}
}
p = new Node(x);
if(p.data<r.data){
r.left = p;
}
else{
r.right = p;
}
}
boolean search(int x){
Node t = root;
while(t!=null){
if(x==t.data){
return true;
}
else if(x<t.data){
t = t.left;
}
else{
t = t.right;
}
}
return false;
}
void Inorder(Node n){
if(n!=null){
System.out.print(n.data+" ");
Inorder(n.left);
Inorder(n.right);
}
}
public static void main(String[] args){
BST l = new BST();
l.Insert(4);
l.Insert(5);
l.Insert(2);
l.Inorder(l.root);
System.out.println(l.search(15));
}
}
|