void Tree::recursivePrintTree(treeNode *node,Print &print) { if(node->left!=NULL)//check left node { recursivePrintTree(node->left, print);// clear left node } if(node->right!= NULL)//check right node { recursivePrintTree(node->right, print);// Clear right node } print.printToken(node->data); delete node; // Destroy this node }