void BinarySearchTree<T>::traversePostorder(Node<T> *curNode) { if(curNode) { traversePostorder(curNode->getLeft()); traversePostorder(curNode->getRight()); std::cout << " " << curNode->getElement(); } }
void BinarySearchTree<T>::traversePostorder() { std::cout << "Tree Postorder traversal: "; if(!root) std::cout << "(nil)"; traversePostorder(root); std::cout << "\n"; }
// post order traversal. void traversePostorder(BTreeNode *head, vector<int> &vals) { if(NULL == head) return; traversePreorder(head->left); traversePostorder(head->right); vals.push_back(head->val); }