You are viewing a single comment's thread. Return to all comments →
void preOrder( struct node *root) { if(root == NULL) return; printf("%d\t",root->data); preOrder(root->left); preOrder(root->right); return; }
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 →
void preOrder( struct node *root) { if(root == NULL) return; printf("%d\t",root->data); preOrder(root->left); preOrder(root->right); return; }