You are viewing a single comment's thread. Return to all comments →
100% Correct Postorder:-Left, Right ,Root. void Postorder( struct node *root) { if(root!=NULL) { Postorder(root->left); 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 →
100% Correct Postorder:-Left, Right ,Root. void Postorder( struct node *root) { if(root!=NULL) {
Postorder(root->left);
Postorder(root->right); printf("%d ",root->data);
} }