Adding a very simple (and inefficient) depth calculation.

isaacs · Jun 9, 2009 · 6e9ac64 · 6e9ac64
1 parent 35d1e54
commit 6e9ac64
Showing 1 changed file with 9 additions and 3 deletions.
diff --git a/data-structures/binary-search-tree/binary-search-tree.js b/data-structures/binary-search-tree/binary-search-tree.js
@@ -74,11 +74,17 @@ BinarySearchTree.prototype = {
 	contains : function (n) {
 		return this.find(n) !== undefined;
 	},
+	depth : function () {
+		var d = 0;
+		this.traverse(function (_, depth) { if (depth > d) d = depth; });
+		return d;
+	},
 	// Call the supplied function on each node in ascending order.
 	traverse : function (fn) {
-		if (this.left !== undefined) this.left.traverse(fn);
+		var depth = arguments[1] || 0;
-		if (this.value !== undefined) fn.call(this, this.value);
+		if (this.left !== undefined) this.left.traverse(fn, depth + 1);
-		if (this.right !== undefined) this.right.traverse(fn);
+		if (this.value !== undefined) fn.call(this, this.value, depth);
+		if (this.right !== undefined) this.right.traverse(fn, depth + 1);
 	},
 	toArray : function (omitSelf) {
 		var arr = [];