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: Postorder Traversal
  5. Discussions

Tree: Postorder Traversal

  • emhhacker
     + 0 comments

    My Java solution with o(n) time complexity and o(h) space complexity:

    public static void postOrder(Node root) {
        if(root == null) return;
        
        postOrder(root.left);
        postOrder(root.right);
        System.out.print(root.data + " ");
    }