Gli alberi attraversamento inorder iterativo

• void inorder(nodo *tree){
• int top=-1;
• nodo *stack[MAX_SIZE_STACK];
• for(;;){
• for(;tree;tree=tree->sinistra)
• add_stack(&top, tree);
• tree=delete_stack(&top);
• if(!tree)break;
• printf("%? \n", tree->dato);
• tree = tree->destra;
• }
• }

Previous slide

Next slide

Back to the index

View Graphic Version

otterremmo ((A/B)-(C*D))+(E^F) cioč il formato infisso.