Pregunta de entrevista de Palantir Technologies

Do a binary tree traversal with constant memory (no stacks).

Respuestas de entrevistas

Anónimo

6 de dic de 2011

See Morris Binary Tree Traversal. Just search it on google.

Anónimo

20 de feb de 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/