Write a Java code for postorder traversal of a binary tree

// Postorder Java code for traversing a binary tree public void postOrder(Node root) { if(root == null) return; postOrder(root.left); postOrder(root.right); System.out.println(root.data) ; }