js: binary tree objects

binarytreeobj.js

var Node = function(o){
	this.key = o.key;
	this.data = o.data;
	this.left = {};
	this.right = {};
}

var BinaryTree = function(o) {

	this.tree = o.tree;

	this.insert = function(node) {
		function iter(tree) {
			if(node.key > tree.key) {
				if(Object.keys(tree.right).length === 0) tree.right = node;
				else iter(tree.right);
			} else {
				if(Object.keys(tree.left).length === 0) tree.left = node;
				else iter(tree.left);
			}
		}
		return iter(this.tree);
	};

	this.delete = function(node) {

	};

	this.search = function(key) {
		function iter(node) {
			if(Object.keys(node).length === 0) return false;
			if(key === node.key) return node;
			else if(key > node.key) {
				return iter(node.right);
			}
			else return iter(node.left);
		}
		return iter(this.tree);
	};
}

tree = new BinaryTree({tree: new Node({key: 100, data: 'foo'})});

tree.insert(new Node({key: 50, data: 'bar'}));
tree.insert(new Node({key: 120, data: 'gaz'}));

tree.search(100);
tree.search(50);
tree.search(120);
tree.search(0); // false
tree.search(200); // false