資料結構之---C語言實現二叉樹的二叉鏈表格儲存體表示

標籤：

//二叉樹的二叉鏈表格儲存體表示//楊鑫#include <stdio.h>#include <stdlib.h>#define max(a, b) a > b ? a : b                      //自訂max()函數typedef char TELemType;//定義結二叉樹的構體typedef struct BTree{TELemType data;struct BTree *lChild;struct BTree *rChild;}BinTree;//二叉樹的建立BinTree* CreateTree(BinTree *T){char temp;scanf("%c", &temp);if(temp == '0')return 0;T = (BinTree *)malloc(sizeof(BinTree));T->data = temp;T->lChild = CreateTree(T->lChild);//遞迴建立左子樹T->rChild = CreateTree(T->rChild);//遞迴建立右子樹return T;}//計算葉子結點的數量int sumleft(BinTree *T){int sum = 0, leftNum, rightNum;if(T){if((!T->lChild) && (!T->rChild)){sum++;}leftNum = sumleft(T->lChild);sum += leftNum;rightNum = sumleft(T->lChild);sum += rightNum;}return sum;}//先序遍曆二叉樹void PreOrderTraverse(BinTree *T){if(T){printf("%c", T->data);PreOrderTraverse(T->lChild);PreOrderTraverse(T->rChild);}}//中序遍曆二叉樹void InOrderTraverse(BinTree *T){if(T){InOrderTraverse(T->lChild);printf("%c", T->data);InOrderTraverse(T->rChild);}}//後序遍曆二叉樹void PostOrderTraverse(BinTree *T){  if(T)   {     PostOrderTraverse(T->lChild);  PostOrderTraverse(T->rChild );  printf("%c",T->data );   }}//統計樹的深度int getDepth(BinTree *T){int dep = 0, depleft, depright;if(!T)dep = 0;else{depleft = getDepth(T->lChild);depright = getDepth(T->rChild);dep = 1 + max(depleft, depright);}return dep;}int main(){BinTree *Tree;Tree = CreateTree(Tree);printf("=========分隔字元============\n\n");printf("二叉樹的先序遍曆：\n");PreOrderTraverse(Tree);printf("\n");printf("二叉樹的中序遍曆：\n");InOrderTraverse(Tree);printf("\n");printf("二叉樹的後序遍曆：\n");PostOrderTraverse(Tree);printf("\n");printf("\n=========================\n");printf("葉子結點數為: %d\n", sumleft(Tree));printf("二叉樹的深度為:%d\n", getDepth(Tree));return 0;}

資料結構之---C語言實現二叉樹的二叉鏈表格儲存體表示