void postorder_walk(struct t_node *root, print pr) { if(root) { postorder_walk(root->left, pr); postorder_walk(root->right, pr); pr(root->data); } }
void postorder_walk(struct nod_arbore *radacina) { if (radacina != NULL) { postorder_walk(radacina->left); postorder_walk(radacina->right); printf("%d ", radacina->key); } }
void postorder(struct bs_tree *tree, print pr) { postorder_walk(tree->root, pr); printf("\n"); }