Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
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
You can’t perform that action at this time.