We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Tree: Preorder Traversal
  2. Discussions

Tree: Preorder Traversal

  • lynx3535
     + 0 comments

    C++ O(n)

    an elegant way to write it is by using recursion: 

    void preOrder(Node *root) {
    if(root == NULL) return;

    std::cout << root->data << " ";

    preOrder(root->left);
    preOrder(root->right);
}