infixToBinaryUpdateTree

infixToBinaryUpdateTree

var updateTree = function() {
	var operator = operatorStack.pop(),
		output = outputStack.pop();
	if (head == null) {
		head = new BinaryTreeNode(operator);
		left = outputStack.pop();
		head.left = left instanceof BinaryTreeNode ? left : new BinaryTreeNode(left);
		head.right = output instanceof BinaryTreeNode ? output : new BinaryTreeNode(output);
	} else {
		var subtree = head;
		head = new BinaryTreeNode(operator);
		head.left = output instanceof BinaryTreeNode ? output : new BinaryTreeNode(output);
		head.right = subtree;
	}
}