Skip to content

Instantly share code, notes, and snippets.

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