Skip to content

Instantly share code, notes, and snippets.

What would you like to do?
Depth-First Search Post-Order traversal
// DFS post-order print of all values in BST
static void printPostOrder(Node current){
// print left child
if(current.left != null) printInOrder(current.left);
// print right child
if(current.right != null) printInOrder(current.right);
// print current node data
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment