You are viewing a single comment's thread. Return to all comments →
my C++ Solution
void preOrder(Node *root) { if(root) {cout<<root->data<<" "; preOrder(root->left); 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 →
my C++ Solution