You are viewing a single comment's thread. Return to all comments →
c++
void inOrder(Node *root) { if(root->left!=nullptr) inOrder(root->left); if(root!=nullptr) cout<<root->data<<" "; if(root->right!=nullptr) 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 →
c++