binary-search-trees/main.js at main · hasan-mostafa1/binary-search-trees · GitHub

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
import { prettyPrint } from "./prettyPrint.js";
import { Tree } from "./tree.js";

function randomArray(length = 10) {
  let arr = [];
  while (length >= 0) {
    arr.push(Math.floor(Math.random() * 100));
    length--;
  }
  return arr;
}
const testArray = randomArray();
const tree = new Tree(testArray);
prettyPrint(tree.root);

console.log("is balanced:", tree.isBalanced());

console.log("level order traversal...");
tree.levelOrderForEach((node) => {
  console.log(node.data, "");
});

console.log("preorder traversal...");
tree.preOrderForEach((node) => {
  console.log(node.data, "");
});

console.log("postorder traversal...");
tree.postOrderForEach((node) => {
  console.log(node.data, "");
});

console.log("inorder traversal...");
tree.inOrderForEach((node) => {
  console.log(node.data, "");
});

// Unbalance the tree
console.log("Unbalancing the tree by adding 300, 200, and 700..");
tree.insert(300);
tree.insert(200);
tree.insert(700);

prettyPrint(tree.root);
console.log("is balanced:", tree.isBalanced());

//Balance the tree
console.log("rebalancing the tree..");
tree.rebalance();
prettyPrint(tree.root);
console.log("is balanced:", tree.isBalanced());

console.log("level order traversal...");
tree.levelOrderForEach((node) => {
  console.log(node.data, "");
});

console.log("preorder traversal...");
tree.preOrderForEach((node) => {
  console.log(node.data, "");
});

console.log("postorder traversal...");
tree.postOrderForEach((node) => {
  console.log(node.data, "");
});

console.log("inorder traversal...");
tree.inOrderForEach((node) => {
  console.log(node.data, "");
});