Tree In Order Traversal Algorithm on the SSaurel's Channel

InOrderTraverse.java

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

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