algorithms/solutions/data-structures/binary-tree/BinaryTree.js at master · tomcostello/algorithms · 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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95


import BinaryTreeNode from './BinaryTreeNode';

export default class BinaryTree {
  constructor() {
      this.store = new BinaryTreeNode();
  }


//Traverse the tree in-order and call callback on the value of each node.

 inOrder(callback){
    var node = this.store;
     node.inOrder(callback);
     return;

}


 postOrder(callback){

     var node = this.store;
     node.postOrder(callback);
     return;

}


 preOrder(callback){

     var node = this.store;
     node.preOrder(callback);
     return;

}


numberOfNodes(){
   var count = 0;
   this.inOrder( a => { count++;})
  return count;
}

numberOfLeaves(){
   var count = 0;
   this.inOrder( a => { if (!a.left && !a.right) count++;})
  return count;
}

// use a call back that

height(){
    return this.store.height();
}

    numberOfLeaves(){
	return this.store.numberOfLeaves()
}

numberOfNodes(){
    return this.store.numberOfNodes()
}


balanced(){
    return this.store.balanced()
}


degenerate(){
    return this.store.degenerate()
}

perfect(){
    return this.store.perfect()
}

complete(){
    return this.store.complete();
}


 toString(){
     // traverse in order
     var res =  [];
     this.inOrder(a => { res.push(a.value);} );
     return res.toString();
 }

}