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

void Tree::InOrderTree()

{

       stack s;

       node *p = root;

      

       while(p != NULL || !s.empty())

       {

              while(p != NULL)

{

       s.push(p);

       p = p->left;

}

if(!s.empty())

{

       p = s.top();

       s.pop();

       cout<data<<" ";

       p = p->right;

}

}

}