Skip to content

Instantly share code, notes, and snippets.

@xnorcode

xnorcode/BinarySearchTreeDFSInOrder.java

Last active October 7, 2018 22:08
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 xnorcode/21a758d9c8f88ba79e583a51512f50fc to your computer and use it in GitHub Desktop.
Save xnorcode/21a758d9c8f88ba79e583a51512f50fc to your computer and use it in GitHub Desktop.
Download ZIP
Depth-First Search In-Order traversal
Raw
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);
}
...
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment