#include <iostream> using namespace std; typedef char ElemType;typedef struct BiNode {//節(jié)點(diǎn)的創(chuàng)建ElemType data;struct BiNode *lchild, *rchild; } BiNode, *BiTree;void PreOrderTraverse(BiTree T) {//先序遍歷if (T) {cout << T->data;PreOrderTraverse(T->lchild);PreOrderTraverse(T->rchild);} }void InOrderTraverse(BiTree T) {//中序遍歷if (T) {InOrderTraverse(T->lchild);cout << T->data;InOrderTraverse(T->rchild);} }void PostOrderTraverse(BiTree T) {//后序遍歷if (T) {PostOrderTraverse(T->lchild);PostOrderTraverse(T->rchild);cout << T->data;} }void CreateBiTree(BiTree &T) {//創(chuàng)建二叉樹(shù)char ch;cin >> ch;if (ch == '#')T = NULL;else {T = new BiNode;T->data = ch;CreateBiTree(T->lchild);CreateBiTree(T->rchild);} }void Copy(BiTree T, BiTree &NewT) {//復(fù)制出一個(gè)新的二叉樹(shù)if (T == NULL) {NewT = NULL;return ;} else {NewT = new BiNode;NewT->data = T->data;Copy(T->lchild, NewT->lchild);Copy(T->rchild, NewT->rchild);} }int Depth(BiTree T) {//求深度if (T == NULL)return 0;else {int m = Depth(T->lchild);int n = Depth(T->rchild);if (m > n)return (m + 1);elsereturn (n + 1);} }int NodeCount(BiTree T) {//求節(jié)點(diǎn)的個(gè)數(shù)if (T == NULL)return 0;elsereturn NodeCount(T->lchild) + NodeCount(T->rchild) + 1; }int LeafCount(BiTree T) {//求葉子的個(gè)數(shù)if (T == NULL)return 0;if (T->lchild == NULL && T->rchild == NULL)return 1;elsereturn LeafCount(T->lchild) + LeafCount(T->rchild); }int main() {BiTree T;//創(chuàng)建一顆二叉樹(shù)cout << "以先序遍歷輸入(以#結(jié)束)要存儲(chǔ)的元素" << endl;CreateBiTree(T);cout << "先序遍歷輸出: ";PreOrderTraverse(T);cout<<endl;cout << "中序遍歷輸出: ";InOrderTraverse(T);cout<<endl;cout << "后序遍歷輸出" ;PostOrderTraverse(T);cout<<endl;cout << "該樹(shù)的深度為: ";cout << Depth(T) << endl;cout << "該樹(shù)的節(jié)點(diǎn)個(gè)數(shù)為: ";cout << NodeCount(T) << endl;cout << "該樹(shù)的葉子個(gè)數(shù)為: ";cout << LeafCount(T) << endl;system("pause");return 0; }

測(cè)試效果圖：

測(cè)試結(jié)果：

本文參考文章地址：
https://blog.csdn.net/deaidai/article/details/71834241

總結(jié)

以上是生活随笔為你收集整理的C++实现链式存储二叉树的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。