Pregunta de entrevista de Amazon
Binary search trees
Respuesta de la entrevista
Anónimo
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.