Amazon interview question
Binary search trees
Interview Answer
Anonymous
9 Feb 2013
A binary search tree is a type tree which is in sorted form and has a leaf node which have two nodes, and each and every node can have maximum two child nodes.
Binary search trees
Anonymous
A binary search tree is a type tree which is in sorted form and has a leaf node which have two nodes, and each and every node can have maximum two child nodes.
Check out your Company Bowl for anonymous work chats.