infixBinaryTreeLogic

infixBinaryTreeLogic

		...
		
		if (token.length == 1 && isNaN(token)) { 
			var operator = createOperator(token);
			if (!operatorStack.isEmpty() && operator.lessOrEqualInPrecedenceTo(operatorStack.peek())) {
				var subtree = createSubtree(operatorStack.pop(), null);
				outputStack.push(subtree);
			}
			operatorStack.push(operator);
		} else {
			outputStack.push(parseInt(token));
		}
	}

	while (!operatorStack.isEmpty()) {
		updateTree();
	}

	return head;
}