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. Prepare
  2. Data Structures
  3. Trees
  4. Tree: Preorder Traversal
  5. Discussions

Tree: Preorder Traversal

  • emhhacker
     + 0 comments

    My Java solution with linear time complexity and constant space complexity:

    public static void preOrder(Node root) {
        if(root == null) return; //no val to be printed
        
        //print val
        System.out.print(root.data + " ");
        
        //recursively traverse thru left nodes first, the through right nodes
        preOrder(root.left);
        preOrder(root.right);
    }