Amazon interview question
How would you implement a binary search algorithm for a tree-type data structure?
Interview Answer
Anonymous
18 Feb 2011
convert the tree into a binary search tree. you will not have memory loss, if for every node you create, you delete one from the tree.