二叉樹(shù)的先中相關(guān)常用算法c語(yǔ)言版

1、#include #include typedef char T;typedef struct btnode結(jié)點(diǎn)定義T Element; struct btnode *LChild,*RChild;BTNode;typedef struct btree頭結(jié)點(diǎn)定義struct btnode *Root;BTree;BTNode* NewNode()創(chuàng)建空間BTNode *p=(BTNode*)malloc(sizeof(BTNode); return p;BTNode * DGCreateBT()遞歸創(chuàng)建一棵二叉樹(shù)char c;BTNode *s;s=(BTNode *)malloc(sizeo

2、f(BTNode); c=getchar();scanf(%c,&c); getchar();if(c=.)s=NULL;elses=NewNode(); s=(BTNode *)malloc(sizeof(BTNode); s-Element=c; s-LChild=DGCreateBT(); s-RChild=DGCreateBT();return s; void Visit(BTNode *p) 輸出結(jié)點(diǎn)*P的元素值 printf(%3c,p-Element);void PreOrd(BTNode *t)先序遍歷遞歸函數(shù)if(t)(*Visit)(t);PreOrd(t-LChild);

3、PreOrd(t-RChild);void InOrd(BTNode *t)中序遍歷遞歸函數(shù)if(t)InOrd(t-LChild);(*Visit)(t);InOrd(t-RChild);void PostOrd(BTNode *t)后序遍歷遞歸函數(shù)if(t)PostOrd(t-LChild);PostOrd(t-RChild);(*Visit)(t);先序遍歷中序遍歷后序遍歷先序遍歷中序遍歷后序遍歷/*void PreOrder(BTree Bt,void (*Visit)(BTNode *u) PreOrd(VisitjBtRoot);void InOrder(BTree Bt,void

4、 (*Visit)(BTNode *u)InOrd(Visit,BtRoot);void PostOrder(BTree Bt,void (*Visit)(BTNode *u) PostOrd(Visit,Bt.Root);*/int s,s1,s2;if(!p)return 0;elses1=Size(p-LChild);s2=Size(p-RChild);s=s1+s2+1;return s;int SizeofBT(BTree Bt)樹(shù)的結(jié)點(diǎn)數(shù)return Size(Bt.Root);int Depth(BTNode *p)樹(shù)的高度遞歸函數(shù)if(!p)return 0;elseretur

5、n 1+max(Depth(p-LChild),Depth(p-RChild);/*int DepthofBT(BTree Bt)樹(shù)的高度return Depth(Bt.Root);*/void PrintLeaf(BTNode *bt)if(bt!=NULL)if(bt-LChild=NULL&bt-RChild=NULL) printf(%3c,bt-Element);elsePrintLeaf(bt-LChild);PrintLeaf(bt-RChild);int s1,s2;if(bt!=NULL)if(bt-LChild=NULL&bt-RChild=NULL) return 1;e

6、lses1=CountLeaf(bt-LChild); s2=CountLeaf(bt-RChild); return s1+s2;return 0;int main(void)BTNode *bt;BTree Bt;int NumLeaf=0,TotalLeaf=0,TreeDepth=0,k=0; bt=NewNode();printf(請(qǐng)輸入先序正確樹(shù)的結(jié)點(diǎn)數(shù)據(jù)(輸入代表空)n); getchar();bt=DGCreateBT();printf(先序遍歷測(cè)試結(jié)果：”)；PreOrd(bt);printf(n中序遍歷測(cè)試結(jié)果：”)；InOrd(bt);printf(n后序遍歷測(cè)試結(jié)果：”)；PostOrd(bt);printf(n);printf(n樹(shù)的葉子結(jié)點(diǎn)為:”)；PrintLeaf(bt);/7/Z7/7/7/7/7/7/Z/7NumLeaf=Size(bt);llllllllllllllllllllllllllllllllllllllllllllllllllllll77BtRoot=bt;llk=SizeofBT(Bt);llprintf(nk=%dn,k);printf(n 樹(shù)的結(jié)點(diǎn)數(shù)為：%dn,NumLeaf);llllllllllllllllllllllllllllllllllllllllllllllllllllllTotalLeaf=CountL