£¨1£©½¨Á¢°üº¬10¸ö½áµãµÄ¶þ²æÊ÷£¨Ê÷½á¹¹ºÍÊý¾ÝÔªËصÄÖµÓÉ×Ô¼ºÉ趨£©£» £¨2£©Íê³É

Ò»ÄêºÃÔËËæ´ºµ½ Ëļ¾²ÊÔƹö¹öÀ´ ºáÅú£ºÍòÊÂÈçÒâ

±ãдµÄ£¬±ð¼û¹Ö¡­¡­

#include iostream

Ëæ±ãдµÄ£¬±ð¼û¹Ö¡­¡­

#include
#include

using namespace std;

#define MAX_TREE_NODE 10

struct Node
{
int elem;
struct Node *pLeft , *pRight;
bool bVisit;

Node() : elem(0) , pLeft(NULL) , pRight(NULL) , bVisit(false)
{
}
};

void BuildTree(struct Node **pTree)
{
if (pTree == NULL)
{
  return ;
}

for ( int i = 0; i < MAX_TREE_NODE; ++i )
{
  struct Node *pElem = new Node;
  if (pElem == NULL)
  {
   continue;
  }

  coutpElem->elem;

  if (*pTree == NULL)
  {
   *pTree = pElem;
  }
  else
  {
   Node *pCompare = *pTree;
   while( pCompare != NULL)
   {
    if ( pElem->elem > pCompare->elem )
    {
     if (pCompare->pRight != NULL)
     {
      pCompare = pCompare->pRight;
     }
     else
     {
      pCompare->pRight = pElem;
      break;
     }
    }
    else
    {
     if (pCompare->pLeft != NULL)
     {
      pCompare = pCompare->pLeft;
     }
     else
     {
      pCompare->pLeft = pElem;
      break;
     }
    }
   }
  }
}
}

//°ÑÕû¸öÊ÷±ê¼Ç³Éδ·ÃÎÊ״̬  ·ÀÖ¹·ÃÎÊÍêÔٴηÃÎÊʱ³öÏÖÎÞ·¨·ÃÎÊ
void MakeTreeUnVisit(struct Node *pTree)
{
stack s;

s.push( pTree );

while ( !s.empty() )
{
  struct Node *pVisit = s.top();

  s.pop();

  if ( pVisit )
  {
   pVisit->bVisit = false;

   s.push( pVisit->pRight );

   s.push( pVisit->pLeft );

  }
}
}

//Ç°Ðò ¸ù-×ó-ÓÒ
void PrintTree_1(struct Node *pTree)
{
stack s;

s.push( pTree );

while ( !s.empty() )
{
  struct Node *pVisit = s.top();

  s.pop();

  if ( pVisit )
  {
   coutpLeft ); //×ó

    pVisit->bVisit = true;
   }
  }
}

coutpRight );

    s.push( pVisit );

    s.push( pVisit->pLeft );

    pVisit->bVisit = true;
   }
   else
   {
    cout