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

Sort by

recency

|

72 Discussions

|

  • saturday10pm
     + 0 comments

    The tricky part is how to convert input to the tree, other than the traversal...

  • aditaima2004
     + 0 comments

    This is one possible solution in python

    def preOrder(root):
    if root:
        print(root, end=' ')
        preOrder(root.left)
        preOrder(root.right)

  • 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);
}

  • infinia
     + 0 comments

    This is a terribly written problem.

  • abdulsohail699
     + 0 comments

    Java

    • visit the nodes in a order. left then right.
    • Recursive call on left sub tree.
    • Recursive call on right sub tree.
    public static void preOrder(Node root) {
        if(root != null){
            System.out.print(root.data+" ");
            preOrder(root.left);
            preOrder(root.right);
        }
    }