title: Evaluating an expression tree without a stack
body: <p>Is it possible to evaluate an expression tree (pre/postfix) without using a stack? Had this question while talking about trees in the algorithm class at school. My guess is no.</p>