Question d’entretien chez Palantir Technologies

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

Réponses aux questions d'entretien

Utilisateur anonyme

6 déc. 2011

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

Utilisateur anonyme

20 févr. 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/