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