Inorder Traversal

An inorder traversal of a binary search tree is a traversal of the tree where the leftmost node is traversed, then it’s parent, then it’s right child.

---

Code

void inorderPrint() {
	inorderPrint(this.root);
}
 
static void inorderPrint(Node node) {
	inorderPrint(node.left);
	System.out.println(node.data);
	inorderPrint(node.right);
}