-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinarySearchTree.java
More file actions
104 lines (88 loc) · 1.55 KB
/
BinarySearchTree.java
File metadata and controls
104 lines (88 loc) · 1.55 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
public class BinarySearchTree
{
private TreeNode root;
private class TreeNode
{
private TreeNode left;
private TreeNode right;
private int data;
public TreeNode(int data)
{
this.data = data;
}
}
public void insert(int value)
{
root = insert(root,value);
}
public TreeNode insert(TreeNode root, int value)
{
if(root==null)
{
root = new TreeNode(value);
return root;
}
if(value<root.data)
{
root.left = insert(root.left,value);
}
if(value>root.data)
{
root.right = insert(root.right,value);
}
return root;
}
public void inorder()
{
inorder(root);
}
public void inorder(TreeNode root)
{
if(root==null)
{
return;
}
inorder(root.left);
System.out.println(root.data+ " ");
inorder(root.right);
}
public TreeNode search(int key)
{
return search(root,key);
}
public TreeNode search(TreeNode root, int key)
{
if(root==null || root.data==key)
{
return root;
}
if(key<root.data)
{
return search(root.left, key);
}
else
{
return search(root.right, key);
}
}
public static void main(String args[])
{
BinarySearchTree bst = new BinarySearchTree();
//insert Elements in binary search tree
bst.insert(5);
bst.insert(2);
bst.insert(7);
bst.insert(1);
bst.insert(10);
bst.insert(9);
//To display elements of binary search tree
bst.inorder();
//To find elements from binary search tree
if(bst.search(7)!=null) {
System.out.println("Element found!!");
}
else {
System.out.println("Element not present!!");
}
}
}