Ejemplo n.º 1
0
void CTree::MidOrder(CTreeNode *lpRoot)
{
    if (lpRoot != NULL)
    {
        MidOrder(lpRoot->m_lpLeft);
        cout << lpRoot->m_data << " ";
        MidOrder(lpRoot->m_lpRight);
    }
}
Ejemplo n.º 2
0
void MidOrder(BTree *tree)
{
    if(tree==NULL)
        return ;
    if(tree->lchild!=NULL)
        MidOrder(tree->lchild);
    Operator(tree->data);
    if(tree->rchild!=NULL)
        MidOrder(tree->rchild);
}