Aruba Networks
Parte de Hewlett Packard Enterprise | HPE
Empleador activo
Pregunta de entrevista de Aruba Networks
Binary search tree traversal without recursion (parent pointer provided)?
Respuesta de la entrevista
Anónimo
15 de oct de 2012
use stack for iteratively going through nodes. //Stack S; While(1) { while(root) { //print root->data push (S,root); root = root->left; } if(isemptystack(S) return; root = Pop(S); //after left subtree, goto right subtree root = root->right; }
1