Given a binary tree with only upwards (parent) node references, re-construct the tree adding in child references. You are given a list of leaf nodes (sorted in left to right order). Tricks include making sure to account for extremely unbalanced trees.

Question

Given a binary tree with only upwards (parent) node references, re-construct the tree adding in child references.  You are given a list of leaf nodes (sorted in left to right order).  Tricks include making sure to account for extremely unbalanced trees.

Anonymous · Accepted Answer

Recommend liberal use of queues

MSCS · Answer

Can use a layer-by-layer recursive method.

Ron · Answer

Can you elaborate pls..

Amazon

Amazon interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches