2025年探索樹(shù)木結(jié)構(gòu)與生長(zhǎng)的實(shí)驗(yàn)研究

數(shù)據(jù)構(gòu)造課內(nèi)試驗(yàn)匯報(bào)試驗(yàn)題目1.掌握二叉樹(shù)的建立，遞歸遍歷(先序，中序，后序),打印樹(shù)狀二叉樹(shù)，計(jì)算葉子節(jié)點(diǎn)的個(gè)數(shù)。2.二叉樹(shù)的非遞歸遍歷3.掌握哈夫曼樹(shù)的基本算法。1.樹(shù)的遞歸與非遞歸遍歷(1)從鍵盤接受輸入先序序列，以二叉鏈表作為存儲(chǔ)構(gòu)造，建立二叉樹(shù)(以先序來(lái)建立),(3)對(duì)其進(jìn)行遍歷(先序、中序和后序),(4)最終將遍歷成果打印輸出在遍歷算法中(5)規(guī)定至少有一種遍歷采用非遞歸措施(1)從終端讀入字符集大小n,以及n個(gè)字符和n個(gè)權(quán)值，建立哈夫曼樹(shù)；(2)打印每一種字符對(duì)應(yīng)的哈夫曼編碼。各個(gè)模塊詳細(xì)的功能描述。voidPreleaf(BTreeroot);先序求葉子節(jié)點(diǎn)個(gè)數(shù)voidPrintfTree(BTreeroot,inth);打印二叉樹(shù)intPostHeight(BTreeroot);后序求樹(shù)的深度voidInitTree(BiTree*bt);初始化樹(shù)intInitStack(Stack*top);初始化棧BiTnode*Create();//擴(kuò)展結(jié)點(diǎn)創(chuàng)立二叉樹(shù)intGetTop(Stacktop,BiTreep);取棧頂元素voidPreStack(BTreeroot);//非遞歸先序遍歷voidSelect(HTreeht,intpos/*尋找的范圍*/,int*s1,int*s2)/查找最小的兩個(gè)節(jié)點(diǎn)的下標(biāo)voidCreatHuffmanTree(HTreeht,intw[],intnvoiOutput(HTreeht,intn)//輸出哈夫曼樹(shù)voidCodeHuffmanTree(HTreeht,HCodehcvoidOutputCode(HCodehc,intw[],intn)//輸出編碼{{printf("%c',bt->dat}}{{printf("%c'",bt->data);}}printf("%c',bt->data);}}」}))if(bt!=NULL){hl=PostTreeDepth(bt->hr=PostTreeDepth(bt->R}}{{}」p=bt;」))}」}}voidPrintTree(BiTreebt,intnLayer){PrintTree(bt->RChildprintf("%cln",bt->daPrintTree(bt->LChild}voidLeafTree(BiTreebt)//樹(shù)的葉子結(jié)點(diǎn)遍歷」」if(bt->LChild==NULL&&printf("%c",bt->dat}}voidTravel(BiTreebt)//樹(shù)的按層遍歷}}樹(shù)的樹(shù)狀打印：2:哈弗曼voidCreat(HuffmanTreeht,intw[],charp[],intn)//構(gòu)造哈弗曼樹(shù)。{for(i=1;i<=n;i++)//前n個(gè)葉子結(jié)點(diǎn)的初始化」}{ht[i].weight=ht[s1].weight}}//生成哈弗曼樹(shù)的函數(shù)編碼。voidOrderHuffman(HuffmanTreeht,Huffmancodehc,charstr[],intm)//根據(jù)哈弗曼樹(shù)構(gòu)成哈弗曼編碼表hc。{char*cd;//臨時(shí)寄存編碼串。intc,p,i;//c,p分別為孩子和雙親。intstart;//制定編碼cd的起始位置。cd[m-1]='\0';//最終一位置放上字符串的結(jié)束標(biāo)志。{{}{cd[start]='0';//左孩子生成0else//右孩子生成1}hc[i]=(char*)malloc((m-start)*sizeo}}voidprint(HuffmanTree」printf("%4d%4d%4d\n",ht[i].weight,ht[i].LChil}2.對(duì)設(shè)計(jì)及調(diào)試過(guò)程的心得體會(huì)。5、源程序清單(電子版)建立一棵用二叉鏈表方式存儲(chǔ)的二叉樹(shù)，并對(duì)其進(jìn)行遍歷(先序、中序和后序),打印typedefstructNode{{voidInitStack(LinkStack*t{}intIsempty(LinkSta{}intPushStack(LinkStacktop,BiTreex){temp=(SeqStack*)malloc(sizeof(Se}{}{{*bt=(BitNode*)malloc(}}{{{}{}{}{{}{{}{{}}{}{{}}{{}{{{}{}{PrintTree(bt->RChild,PrintTree(bt->LChild,}{{if(bt->LChild==NULL&&bt->RChi}{{}{}#include<stdlib.h>#defineN20typedefchar*Huffmancode[N+1];typedefstruct{voidselect(HuffmanTreeht,intpos,int*s1,int*s2)//尋找最小孩子形成最優(yōu)二叉樹(shù)。{{if(ht[i].parent==0&&ht[i]{}elseif(ht[i].parent=={}{}voidCreat(HuffmanTreeht,intw[],charp[],intn)//構(gòu)造哈弗曼樹(shù)。{for(i=1;i<=n;i++)//前n個(gè)葉子結(jié)點(diǎn)的初始化{}{ht[i].weight=ht[s1].weight+ht[}}voidOrderHuffman(Huffm{cd=(char*)malloc(m*si{{{cd[start]='0';//左孩子生成0}hc[i]=(char*)malloc((m-start)*si}}{pr