数据结构代码参考.pdfVIP

数据结构 p80 页代码实现： #include stdafx.h #include iostream using namespace std; typedef struct bitnode { char data; struct bitnode *lchild,*rchild; }bitnode,*bitree; void createbitree(bitree *t) { char ch; cinch; if(ch==0) (*t)=NULL; else { (*t)=new bitnode; (*t)-data=ch; createbitree((*t)-lchild); createbitree((*t)-rchild); } } void preorderout(bitree t) { if(t) { coutt-data ; preorderout(t-lchild); preorderout(t-rchild); } } void inorderout(bitree t) { if(t) { inorderout(t-lchild); coutt-data ; inorderout(t-rchild); } } void postorderout(bitree t) { if(t) { postorderout(t-lchild); postorderout(t-rchild); coutt-data ; } } bitree search(bitree bt,char x) { bitree p; if(bt) { if(bt-data==x) return bt; if(bt-lchild!=NULL) { p=search(bt-lchild,x); if(p) return p; } if(bt-rchild!=NULL) { p=search(bt-rchild,x); if(p) return p; } } return NULL; } int countleaf(bitree bt) { if(bt==NULL) return 0; if(bt-lchild==NULLbt-rchild==NULL) return 1; return (countleaf(bt-lchild)+countleaf(bt-rchild)); } int num1(bitree T) { if(T==NULL) return 0; else if(T-lchildT-rchild==NULL) return (num1(T-lchild)+1); else if(T-rchildT-lchild==NULL) return (num1(T-rchild)+1); else return (num1(T-lchild)+ num1(T-rchild)); } int depth(bitree T) { int m,n; if (T==NULL) return 0; else { m=depth(T-lchild); n=depth(T-rchild); if(mn) return m+1; else return n+1; } } void main() { bitree bt; bitree t; //init_bitree(bt); createbitree(bt); cout 前序 ; preorderout(bt); coutendl; cout 中序 ; inorderout(bt); coutendl; cout 后序 ;