二叉树的中序遍历(递归)

//not the total code

void Tree::InOrderTree()

{

    if(root==NULL)

        return;

    InOrderTree(root);

}

void Tree::InOrderTree(Node *current)

{

    if(current!=NULL)

    {

        InOrderTree(current->left);

        cout<data<<" ";

        InOrderTree(current->right);

    }

}