資料結構之二叉樹的建立與遍曆

已知一個按先序序列輸入的字元序列，如abc,,de,g,,f,,,(其中逗號表示空節點)。請建立二叉樹並按中序和後序方式遍曆二叉樹，最後求出葉子節點個數和二叉樹深度。

#include<iostream>#include<queue>#include <cstdlib>#include <cstdio>using namespace std;typedef struct BiNode{char data;struct BiNode *left;struct BiNode *right;}BiNode, *BiTree;int sum = 0;void CreateBinaryTree(BiTree &T)//二叉樹建立   abc,,de,g,,f,,,{//T = (BiNode*) malloc (sizeof(BiNode));T = new BiNode;cin >> T->data;if(T->data == ',') {T = NULL; }if(T != NULL){CreateBinaryTree(T->left);CreateBinaryTree(T->right);}}void PreOrder(BiTree T)//前序走訪{if(T != NULL){cout << T->data;PreOrder(T->left);PreOrder(T->right);}}void InOrder(BiTree T)//中序遍曆{if(T != NULL){InOrder(T->left);cout << T->data;InOrder(T->right);}}void PostOrder(BiTree T)//後序遍曆{if(T != NULL){PostOrder(T->left);PostOrder(T->right);cout << T->data;}}void LevOrder(BiTree T)//層次遍曆{if(T != NULL){BiTree p = T;queue<BiTree>que;que.push(p);while(!que.empty()){p = que.front();cout << p->data;que.pop();if(p->left != NULL){que.push(p->left);}if(p->right != NULL){que.push(p->right);}}}}int Size(BiTree T)//計算二叉樹節點數{if(T){if(T->left == NULL && T->right == NULL){sum++;}Size(T->left);Size(T->right);}return sum;}int Deep(BiTree T)//計算二叉樹深度{int m, n;if(T == NULL) return 0;m = Deep(T->left);n = Deep(T->right);if(m > n) return m + 1;else return n + 1;}int main(void){BiTree T;CreateBinaryTree(T);cout << "前序走訪結果為：" << endl;PreOrder(T);cout << endl << endl;cout << "中序遍曆結果為：" << endl;InOrder(T);cout << endl << endl;cout << "後序遍曆結果為：" << endl;PostOrder(T);cout << endl << endl;cout<<"層次遍曆結果為："<<endl;LevOrder(T);cout << endl << endl;cout << "二叉樹分葉節點個數為：" << Size(T)<<endl;cout << "二叉樹深度數為：" << Deep(T) << endl;system("pause");return 0;}