Postorder Traversal

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

---

Code

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