Last active
August 29, 2015 14:07
-
-
Save alexandervasyuk/564dc77637c3004ee69b to your computer and use it in GitHub Desktop.
infixBinaryTreeLogic
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
... | |
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; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment