Do a binary tree traversal with constant memory (no stacks).
Interview Answers
Anonymous
6 Dec 2011
See Morris Binary Tree Traversal. Just search it on google.
Anonymous
20 Feb 2012
Morris Binary Tree Traversal modifies the tree - though eventually it is reverted back to original state.
Take a look at the algorithm proposed at this site.
http://neuraldump.wordpress.com/ome/