You'll have to use a stack to implement a binary tree traversal non-recursively.<P>The advantage of using a dynamically-allocated-on-the-heap stack over just using your OS's call stack is that ...

We give a branch-and-cut algorithm for solving linear programs (LPs) with continuous separable piecewise-linear cost functions (PLFs). Models for PLFs use continuous variables in special-ordered sets ...