#include using namespace std;

typedef struct BiNode { char data; struct BiNode *lchild,*rchild; }BiTNode,*BiTree;

typedef struct stacknode { BiTNode data; struct stacknode *next; }stacknode,*linkstack;

void createBiTree(BiTree &T) {

char ch; cin>>ch; if(ch=='#') T=NULL; else{ T=new BiTNode; T->data=ch; createBiTree(T->lchild); createBiTree(T->rchild); } }

void initstack(linkstack &s) {

s=NULL; }

bool stackempty(linkstack s) { if(!s) return true; return false; }

void push(linkstack &s,BiTree e) {

stacknode *p=new stacknode; p->data=*e; p->next=s; s=p; }

void pop(linkstack &s,BiTree e) { if(s!=NULL) { *e=s->data; stacknode *p=s; s=s->next; delete p; } }

void inordertraversel(BiTree T) {

linkstack s;BiTree p; BiTree q=new BiTNode; initstack(s);p=T; while(p||!stackempty(s)) { if(p) { push(s,p); p=p->lchild; } else { pop(s,q); cout<data; p=q->rchild; } } }

void main() { BiTree tree; cout<<" 请输入建立二叉链表的序列：\n"; createBiTree(tree); cout<<" 中序遍历的结果为：\n"; inordertraversel(tree); cout<<endl; }

#include using namespace std; typedef struct BiNode{ char data; struct BiNode *lchild,*rchild; }BiTNode,*BiTree;

void CreateBiTree(BiTree &T){

char ch; cin>>ch; if(ch=='#') T=NULL; else{ T=new BiTNode; T->data=ch; CreateBiTree(T->lchild); CreateBiTree(T->rchild); } }

void InOrderTraverse(BiTree T){

if(T){
    InOrderTraverse(T->lchild);
    cout<<T->data;
    InOrderTraverse(T->rchild);
}
  }
 
  void main(){
BiTree tree;
cout<<" 请输入建立二叉链表的字列：\n";
CreateBiTree(tree);
cout<<" 中序遍历的结果为：\n";
InOrderTraverse(tree);
cout<<endl;
   }