-
Notifications
You must be signed in to change notification settings - Fork 0
/
BST9.java
70 lines (54 loc) · 1.71 KB
/
BST9.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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
import java.util.ArrayList;
public class BST9 {
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, ArrayList<Integer> arr) {
if (root == null) {
return;
}
Inorder(root.left, arr);
arr.add(root.data);
Inorder(root.right, arr);
}
static Node ToBST(ArrayList<Integer> arr, int start, int end) { // SORTED ARRAY TO BST
if (start > end) {
return null;
}
int mid = (start + end) / 2;
Node root = new Node(arr.get(mid));
root.left = ToBST(arr, start, mid - 1);
root.right = ToBST(arr, mid + 1, end);
return root;
}
static Node BalanceBST(Node root) {
ArrayList<Integer> inorder = new ArrayList<>();
Inorder(root, inorder);
root = ToBST(inorder, 0, inorder.size() - 1);
return root;
}
public static void main(String[] args) {
Node root = new Node(8);
root.left = new Node(6);
root.right = new Node(10);
root.left.left = new Node(5);
root.right.right = new Node(11);
root.left.left.left = new Node(3);
root.right.right.right = new Node(12);
root = BalanceBST(root);
System.out.println(root.data);
System.out.println(root.left.data);
System.out.println(root.right.data);
System.out.println(root.left.left.data);
System.out.println(root.left.right.data);
System.out.println(root.right.left.data);
System.out.println(root.right.right.data);
}
}