void printReversePostorder(const Tree T) { if(T != NULL) { printReversePostorder(T->right); printReversePostorder(T->left); printf(" %i", T->item); } }