You are viewing a single comment's thread. Return to all comments →
Here's one with recursion, makes life easier..!!
void preOrder(node *root) { printf("%d ", root->data); if(root->left) preOrder(root->left); if(root->right) preOrder(root->right); }
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Preorder Traversal
You are viewing a single comment's thread. Return to all comments →
Here's one with recursion, makes life easier..!!