-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbinaryTree.js
More file actions
154 lines (123 loc) · 2.9 KB
/
binaryTree.js
File metadata and controls
154 lines (123 loc) · 2.9 KB
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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
var BinaryTreeNode = function(item , leftChild , rightChild){
this.item = item;
this.leftChild = leftChild;
this.rightChild = rightChild;
//used for cluesTree
this.lbit = 1;
this.rbit = 1;
}
BinaryTreeNode.prototype.getDepth = function(){
var leftDepth = this.leftChild ? this.leftChild.getDepth() : 0;
var rightDepth = this.rightChild ? this.rightChild.getDepth() : 0;
if(leftDepth > rightDepth) {
return leftDepth + 1;
} else {
return rightDepth + 1;
}
}
BinaryTreeNode.prototype.remove = function(){
if(this.parent) {
if(this.parent.leftChild == this) {
this.parent.leftChild = null;
} else if(this.parent.rightChild == this){
this.parent.rightChild = null;
}
}
}
var recurePreOrderTravel = function(node , callback) {
if(!!node) {
callback && callback(node);
recurePreOrderTravel(node.leftChild , callback);
recurePreOrderTravel(node.rightChild , callback);
}
}
var recureMiddleOrderTravel = function(node , callback) {
if(!!node) {
recureMiddleOrderTravel(node.leftChild , callback);
callback && callback(node);
recureMiddleOrderTravel(node.rightChild , callback);
}
}
var recurePostOrderTravel = function(node , callback) {
if(!!node) {
recurePostOrderTravel(node.leftChild , callback);
recurePostOrderTravel(node.rightChild , callback);
callback && callback(node);
}
}
var preOrderTravel = function(node , callback) {
var stack = new Stack();
stack.push(node);
while(!stack.empty()) {
var cnode = stack.pop();
callback && callback(cnode);
if(cnode.rightChild) {
stack.push(cnode.rightChild);
}
if(cnode.leftChild) {
stack.push(cnode.leftChild);
}
}
}
var middleOrderTravel = function(node , callback) {
var stack = new Stack();
var cnode = node;
do {
while(cnode) {
stack.push(cnode);
cnode = cnode.leftChild;
}
cnode = stack.pop();
callback && callback(cnode);
cnode = cnode.rightChild;
} while(!stack.empty() || !!cnode);
}
var postOrderTravel = function(node , callback) {
var stack = new Stack();
var flagStack = new Stack();
var cnode = node;
var flag;
do {
while(cnode) {
stack.push(cnode);
flagStack.push(0);
cnode = cnode.leftChild;
}
cnode = stack.pop();
flag = flagStack.pop();
if(flag == 0) {
stack.push(cnode);
flagStack.push(1);
cnode = cnode.rightChild;
} else {
callback && callback(cnode);
cnode = null;
}
} while(!stack.empty() || !!cnode);
}
var breadthOrderTravel = function(node , callback) {
var queue = new Queue();
queue.enQueue(node);
while(!queue.empty()) {
var p = queue.deQueue();
callback && callback(p);
if(p.leftChild) {
queue.enQueue(p.leftChild);
}
if(p.rightChild) {
queue.enQueue(p.rightChild);
}
}
}
var isTreeNodeInBTree = function(head , node){
if(!head || !node) {
return false;
}
var findFlag = false;
preOrderTravel(head , function(iterator){
if(node == iterator) {
findFlag = true;
}
});
return findFlag;
}