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