You are viewing a single comment's thread. Return to all comments →
C++
void postOrder(Node *root) { if(root->left != nullptr){ postOrder(root->left); } if (root->right != nullptr){ postOrder(root->right); } printf("%d ",root->data); }
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Postorder Traversal
You are viewing a single comment's thread. Return to all comments →
C++