-
Notifications
You must be signed in to change notification settings - Fork 0
/
BST8.java
51 lines (39 loc) · 1.09 KB
/
BST8.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
public class BST8 {
static class Node {
int data;
Node left;
Node right;
Node(int data) {
this.data = data;
this.left = null;
this.right = null;
}
}
static void Inorder(Node root) {
if (root == null) {
return;
}
Inorder(root.left);
System.out.print(root.data + " ");
Inorder(root.right);
}
static Node ToBST(int arr[], int start, int end) { // SORTED ARRAY TO BST
if (start > end) {
return null;
}
int mid = (start + end) / 2;
Node root = new Node(arr[mid]);
root.left = ToBST(arr, start, mid - 1);
root.right = ToBST(arr, mid + 1, end);
return root;
}
public static void main(String[] args) {
int arr[] = {1, 2, 3, 4, 5, 7};
Node root = ToBST(arr, 0, arr.length - 1);
Inorder(root);
System.out.println();
System.out.println(root.data);
System.out.println(root.left.data);
System.out.println(root.right.data);
}
}