Preorder Traversal

A preorder traversal of a binary search tree is a traversal of the tree where the leftmost highest possible key is visited first every time.

---

Code

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