Iterating over a Binary Tree with O(1) Auxiliary Space

Question

Is it possible to iterate over a binary tree in O(1) auxiliary space (w/o using a stack, queue, etc.), or has this been proven impossible? If it is possible, how can it be

Answer 1

http://en.wikipedia.org/wiki/XOR_linked_list

encode your parent node into the leaf pointers