// Prints the tree using pre-order traversal (left child, then right, then parent) // Use the slides, but make sure you understand how a tree is traversed in // post-order void BSTY::printTreePost(NodeT *n) {

}

##include "BSTY.hpp" #include #include #include using namespace std;

With these includes please create this method in C++