层次遍历二叉树
2012-05-24 15:27:35 来源:WEB开发网 闂傚倸鍊搁崐鎼佸磹閹间礁纾归柟闂寸绾惧綊鏌熼梻瀵割槮缁炬儳缍婇弻鐔兼⒒鐎靛壊妲紒鐐劤缂嶅﹪寮婚悢鍏尖拻閻庨潧澹婂Σ顔剧磼閻愵剙鍔ょ紓宥咃躬瀵鎮㈤崗灏栨嫽闁诲酣娼ф竟濠偽i鍓х<闁诡垎鍐f寖闂佺娅曢幑鍥灳閺冨牆绀冩い蹇庣娴滈箖鏌ㄥ┑鍡欏嚬缂併劎绮妵鍕箳鐎n亞浠鹃梺闈涙搐鐎氫即鐛崶顒夋晬婵絾瀵ч幑鍥蓟閻斿摜鐟归柛顭戝枛椤牆顪冮妶搴′簼缂侇喗鎸搁悾鐑藉础閻愬秵妫冮崺鈧い鎺戝瀹撲礁鈹戦悩鎻掝伀缁惧彞绮欓弻娑氫沪閹规劕顥濋梺閫炲苯澧伴柟铏崌閿濈偛鈹戠€n€晠鏌嶆潪鎷屽厡闁汇倕鎳愮槐鎾存媴閸撴彃鍓卞銈嗗灦閻熲晛鐣烽妷褉鍋撻敐搴℃灍闁绘挻娲橀妵鍕箛闂堟稐绨肩紓浣藉煐濮樸劎妲愰幘璇茬闁冲搫鍊婚ˇ鏉库攽椤旂》宸ユい顓炲槻閻g兘骞掗幋鏃€鐎婚梺瑙勬儗閸樺€熲叺婵犵數濮烽弫鍛婃叏椤撱垹纾婚柟鍓х帛閳锋垶銇勯幒鍡椾壕缂備礁顦遍弫濠氱嵁閸℃稒鍊烽柛婵嗗椤旀劕鈹戦悜鍥╃У闁告挻鐟︽穱濠囨嚃閳哄啰锛滈梺褰掑亰閸欏骸鈻撳⿰鍫熺厸閻忕偟纭堕崑鎾诲箛娴e憡鍊梺纭呭亹鐞涖儵鍩€椤掑啫鐨洪柡浣圭墪閳规垿鎮欓弶鎴犱桓闂佸湱枪閹芥粎鍒掗弮鍫熷仺缂佸顕抽敃鍌涚厱闁哄洢鍔岄悘鐘绘煕閹般劌浜惧┑锛勫亼閸婃牠宕濋敃鈧…鍧楀焵椤掍胶绠剧€光偓婵犱線鍋楀┑顔硷龚濞咃絿妲愰幒鎳崇喓鎷犻懠鑸垫毐闂傚倷鑳舵灙婵炲鍏樺顐ゆ嫚瀹割喖娈ㄦ繝鐢靛У绾板秹寮查幓鎺濈唵閻犺櫣灏ㄥ銉р偓瑙勬尭濡繂顫忛搹鍦<婵☆垰鎼~宥囩磽娴i鍔嶉柟绋垮暱閻g兘骞嬮敃鈧粻濠氭偣閸パ冪骇鐎规挸绉撮—鍐Χ閸℃ê闉嶇紓浣割儐閸ㄥ墎绮嬪澶嬪€锋い鎺嶇瀵灝鈹戦埥鍡楃仯闁告鍕洸濡わ絽鍟崐鍨叏濡厧浜鹃悗姘炬嫹

核心提示:#include <stdio.h>#include<stdlib.h>typedef struct Bitree{int data;struct Bitree *Lchild,*Rchild;}BitreeNode,*LinkBitree;typedef struct QueueList{Li
#include <stdio.h> #include<stdlib.h> typedef struct Bitree { int data; struct Bitree *Lchild,*Rchild; }BitreeNode,*LinkBitree; typedef struct QueueList { LinkBitree data[20]; int front,rear; }QueueList,*LinkQueue; LinkBitree CreatBitree(); void LevelOrderTraverse(LinkBitree); void InitQueue(LinkQueue); int main() { LinkBitree BitreeHead; printf("请输入根结点的值e:"); BitreeHead=CreatBitree(); LevelOrderTraverse(BitreeHead); return 0; } LinkBitree CreatBitree() { int e_data; LinkBitree BitreeHead; scanf("%d",&e_data); if(e_data!=0) { BitreeHead=(LinkBitree)malloc(sizeof(BitreeNode)); if(BitreeHead==NULL) { printf("Error!!"); } else { BitreeHead->data=e_data; printf("请输入结点%d的左孩子结点的值:e= ",BitreeHead->data); BitreeHead->Lchild=CreatBitree(); printf("请输入结点%d的右孩子结点的值:e= ",BitreeHead->data); BitreeHead->Rchild=CreatBitree(); } } else { BitreeHead=NULL; } return BitreeHead; } void LevelOrderTraverse(LinkBitree BitreeHead) { LinkQueue Q; Q=(LinkQueue)malloc(sizeof(sizeof(QueueList))); InitQueue(Q); if(BitreeHead!=NULL) { Q->data[Q->rear]=BitreeHead; Q->rear=Q->rear+1; } while(Q->front!=Q->rear) { printf("%d ",Q->data[Q->front]->data); if(Q->data[Q->front]->Lchild!=NULL) { Q->data[Q->rear]=Q->data[Q->front]->Lchild; Q->rear=Q->rear+1; } if(Q->data[Q->front]->Rchild!=NULL) { Q->data[Q->rear]=Q->data[Q->front]->Rchild; Q->rear=Q->rear+1; } Q->front=Q->front+1; } } void InitQueue(LinkQueue Q) { Q->front=Q->rear=0; }
更多精彩
赞助商链接