Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 8a76e90

Browse files
Breadth first traversal
1 parent 91e3c95 commit 8a76e90

File tree

1 file changed

+13
-3
lines changed

1 file changed

+13
-3
lines changed

‎binarySearchTree.js

Lines changed: 13 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -39,6 +39,16 @@ BST.prototype.depthFirstTraversal = function(iteratorFunc, order) {
3939
if (order === "post-order") iteratorFunc(this.value);
4040
};
4141

42+
BST.prototype.breadthFirstTraversal = function(iteratorFunc) {
43+
let queue = [this];
44+
while (queue.length) {
45+
let treeNode = queue.shift();
46+
iteratorFunc(treeNode);
47+
if (treeNode.left) queue.push(treeNode.left);
48+
if (treeNode.right) queue.push(treeNode.right);
49+
}
50+
};
51+
4252
let bst = new BST(50);
4353

4454
bst.insert(30);
@@ -53,8 +63,8 @@ bst.insert(85);
5363
bst.insert(105);
5464
bst.insert(10);
5565

56-
function log(value) {
57-
console.log(value);
66+
function log(node) {
67+
console.log(node.value);
5868
}
5969

60-
bst.depthFirstTraversal(log,"post-order");
70+
bst.breadthFirstTraversal(log);

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /