Simple binary tree structure in a C-like syntax (no class, just node wrapper)

binaryTree.js

var Node = function(v, l, r) { 
  this.value = v; this.left = l || {}; this.right = r || {};
}

Node.prototype.addChildren = function(number) {
		if(number) {
			if(this.value) {
				Node.prototype.parent = this;
				if(this.value > number) {	
					Node.prototype.direction = "left";			
					Node.prototype.addChildren.call(this.left, number);
				} else {
					Node.prototype.direction = "right";
					Node.prototype.addChildren.call(this.right, number);
				}
			} else {
				Node.prototype.direction === "left" ? 
				Node.prototype.parent.left = new Node(number) :
				Node.prototype.parent.right = new Node(number);
				return Node.prototype.parent;
			}
		}
	}