-
Notifications
You must be signed in to change notification settings - Fork 0
/
BST.java
48 lines (43 loc) · 1.18 KB
/
BST.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
public class BST {
static class Node {
int data;
Node left;
Node right;
Node(int data) {
this.data = data;
}
}
public static Node insert(Node root, int val) {
if (root == null) {
root = new Node(val);
return root;
}
if (val < root.data) {
root.left = insert(root.left, val);
} else if (val > root.data) {
root.right = insert(root.right, val);
}
return root;
}
// In-order traversal method
public static void inOrderTraversal(Node root) {
if (root != null) {
inOrderTraversal(root.left);
System.out.print(root.data + " ");
inOrderTraversal(root.right);
}
}
public static void main(String[] args) {
Node root = null;
root = insert(root, 5);
insert(root, 3);
insert(root, 7);
insert(root, 2);
insert(root, 4);
insert(root, 6);
insert(root, 8);
System.out.print("In-order traversal: ");
inOrderTraversal(root);
System.out.println();
}
}