Pergunta de entrevista da empresa MySpace

Print level 'l' of binary search tree.

Resposta da entrevista

Sigiloso

17 de out. de 2010

Use two nodes to keep track of parent and print left and right of parent once the level is reached