void PrintTree(BinaryTreeNode* pRoot) { if (pRoot != NULL) { PrintTreeNode(pRoot); if(pRoot->m_pLeft != NULL) PrintTree(pRoot->m_pLeft); if(pRoot->m_pRight != NULL) PrintTree(pRoot->m_pRight); } }
void PrintTree(TreeNode* pRoot) { PrintTreeNode(pRoot); if (pRoot != NULL) { std::vector<TreeNode*>::iterator iter = pRoot->m_vChildren.begin(); while(iter < pRoot->m_vChildren.end()) { PrintTree((*iter)); iter++; } } }
void PrintTreeNode(TreeNode* node, PrintFunc printer, const int level) { const TreeNode* tn = node; int spaces = 0; if (tn != 0) PrintTreeNode(tn->right_child, printer, level + 1); for (spaces = 0; spaces < level; ++spaces) printf(" "); if (tn != 0) { printer(tn->value); printf("\n"); } else printf("@\n"); if (tn != 0) PrintTreeNode(tn->left_child, printer, level + 1); }
void PrintTree(TreeNode* pRoot) { PrintTreeNode(pRoot); if(pRoot != NULL) { std::vector<TreeNode*>::iterator i = pRoot->m_vChildren.begin(); while(i < pRoot->m_vChildren.end()) { PrintTree(*i); ++i; } } }
void PrintTree(const AVL_tree* tree) { PrintTreeNode(tree->root, tree->functions->printFunc, 0); }