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 fa3f45f

Browse files
Refactoring depth first traversal method
1 parent d1691c4 commit fa3f45f

File tree

1 file changed

+5
-5
lines changed

1 file changed

+5
-5
lines changed

‎binarySearchTree.js

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -31,10 +31,10 @@ BST.prototype.contains = function(value) {
3131
}
3232
};
3333

34-
BST.prototype.depthFirstTraversal = function(iteratorFunc) {
35-
if (this.left) this.left.depthFirstTraversal(iteratorFunc);
36-
iteratorFunc(this.value);
37-
if (this.right) this.right.depthFirstTraversal(iteratorFunc);
34+
BST.prototype.depthFirstTraversal = function(iteratorFunc,order) {
35+
if (this.left) this.left.depthFirstTraversal(iteratorFunc,order);
36+
if(order==="in-order")iteratorFunc(this.value);
37+
if (this.right) this.right.depthFirstTraversal(iteratorFunc,order);
3838
};
3939

4040
let bst = new BST(50);
@@ -55,4 +55,4 @@ function log(value) {
5555
console.log(value);
5656
}
5757

58-
bst.depthFirstTraversal(log);
58+
bst.depthFirstTraversal(log,"in-order");

0 commit comments

Comments
(0)

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