Tree Post Order Traversal Implementation in Java for the SSaurel's Channel

PostOrderTraverse.java

// Left, Right, Root
public static <T> void postOrderTraverse(Node<T> node) {
  if (node == null)
    return;

  postOrderTraverse(node.left);
  postOrderTraverse(node.right);
  System.out.print(node.data + " ");
}