1 void InOrderTraversal(BinTree BT)
 2 { 
 3   BinTree T=BT;
 4   stack S=CreatStack(MaxSize)://创建并初始化堆栈S
 5   while(T || !IsEmpty(S)){
 6     While(T){//一直向左并将沿途节点压入堆栈
 7        printf("%5d",T->Data);//(访问)打印节点
 8        Push(S,T);
 9        T=T->left;
10     }
11     if(! IsEmpty(S)){
12     T=Pop(S);//节点弹出堆栈
13     T=T->Right;//转向右子树
14      }
15    }
16 }