Pergunta de entrevista da empresa Wind River
Assume that you have two binary trees; write a function that parses both the trees at the same time and prints out the numbers (from both trees) in an ascending order. You shouldn't use any additional data structure other than the two binary trees given to you.
Resposta da entrevista
Sigiloso
14 de set. de 2013
Write a function that parses (infix) a given binary tree without using recursion and try to pass both the trees into this function to get & print the values in an ascending order