Pergunta de entrevista da empresa Bloomberg
write the code to traverse a binary tree
Resposta da entrevista
Sigiloso
23 de mar. de 2011
Traverse(Node *root) { if(root) { Traverse(root->left); cout getValue(); Traverse(root->right); } else return;
write the code to traverse a binary tree
Sigiloso
Traverse(Node *root) { if(root) { Traverse(root->left); cout getValue(); Traverse(root->right); } else return;