Pergunta de entrevista da empresa Yahoo
Find the sum of highest k elements in a binary search tree?
Resposta da entrevista
Sigiloso
22 de nov. de 2015
Use a reverse inorder traversal to solve the problem
Find the sum of highest k elements in a binary search tree?
Sigiloso
Use a reverse inorder traversal to solve the problem