Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
Print Post Order Traversal of a binary tree using recursion.
void print_post_order_traversal(TreeNode *root) {
if (root == nullptr) {
return;
}
print_post_order_traversal(root->left);
print_post_order_traversal(root->right);
print(root->value);
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.