Tree: Preorder Traversal

  • + 0 comments
    if(root == nullptr)
              return;
               
    int data = root->data;
    cout<<data <<  " ";
    preOrder(root->left);
    preOrder(root->right);