@@ -0,0 +1,367 @@
+//https://www.hackerrank.com/challenges/tree-postorder-traversal%0A%0A/* You only have to complete the function given below.%0A    class Node %7B%0A        int data;%0A        Node left;%0A        Node right;%0A    %7D%0A*/%0A%0Avoid Postorder(Node root) %7B%0A    if(root != null)%7B%0A        Postorder(root.left);%0A        Postorder(root.right);%0A        System.out.print(root.data + %22 %22);%0A    %7D%0A%7D%0A

Create tree-postorder-traversal.java