Problem
1. Describe a nonrecursive method for evaluating a binary tree representing an arithmetic expression.
2. Describe a nonrecursive method for performing an Euler tour traversal of a binary tree that runs in linear time and does not use a stack
3. Describe, in pseudo-code, a nonrecursive method for performing an in-order traversal of a binary tree in linear time.