BST Post-Order Traversal

1. Visit left subtree
2. Visit right subtree
3. Print data of the node

void print_Order(Node *node){
	if (node != NULL){
		print_Order(node->left); // print left first
		print_Order(node->right); //print right later
		printf("%p", node);
	}
}

Useful for Parsing AST, or BST Delete Tree