Skip to content

Instantly share code, notes, and snippets.

@ssaurel
Created April 9, 2019 10:17
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save ssaurel/e05a76dba20f76c728b689add108f0d2 to your computer and use it in GitHub Desktop.
Save ssaurel/e05a76dba20f76c728b689add108f0d2 to your computer and use it in GitHub Desktop.
Tree Post Order Traversal Implementation in Java for the SSaurel's Channel
// 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 + " ");
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment