ds-algo-study
Version:
Just experimenting with publishing a package
27 lines (21 loc) • 471 B
JavaScript
/*var makeBinarySearchTree = function(val){
var tree;
return tree;
};
makeBinarySearchTree.prototype.insert = function(input){
if(input < this.value){
if(this.left === undefined){
this.left = makeBinarySearchTree(val);
}
}
};
makeBinarySearchTree.prototype.contains = function(){
};
makeBinarySearchTree.prototype.depthFirstLog = function(){
};
var makeNode = function(val){
var node = {};
node.value = val;
node.right;
node.left;
};*/