Depth-First Search In-Order traversal

BinarySearchTreeDFSInOrder.java

...
  
  	// 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
		System.out.println(current.data);
		
		// print right child
		if(current.right != null) printInOrder(current.right);
	}

...