Binary tree with parent pointers, given two nodes find common ancestor.

Question

Anónimo · Accepted Answer

Hint: use a hash table

Rajiv · Answer

For each node traversed from the root,
if both values are less than the current Node, then move to the left
if both values are greater than the currentNode, then move to the right,
if the value of current Node is between value 1 and value 2, then you have found the nearest common ancestor.

dantepy · Answer

Rajiv, you can't do that is tree is by parent pointers. you need to bubble up from the given nodes and put parents to a hash.

Amazon

Pregunta de entrevista de Amazon

Respuestas de entrevistas

Empresas seguidas

Búsquedas de empleo