（C++）二叉树的建立与递归方式遍历

来源：互联网发布：雅各布矩阵和海森矩阵编辑：程序博客网时间：2024/05/21 12:47

数据结构，二叉树的实现与遍历，采用递归的方法，计入下来，共同学习分享，希望大家多跟我说一些写代码的小技巧。

#include <iostream>#include <queue>using namespace std;typedef char T;struct BiNode{T data;BiNode *lchild,*rchild;};class BiTree{public:BiTree(){root=Creat(root);}~BiTree(){Release(root);}void PreOrder(){PreOrder(root);}void InOrder(){InOrder(root);}void PostOrder(){PostOrder(root);}void LevelOrder();private:BiNode *root;BiNode *Creat(BiNode *bt);void Release(BiNode *bt);void PreOrder(BiNode *bt);void InOrder(BiNode *bt);void PostOrder(BiNode *bt);};void BiTree::PreOrder(BiNode *bt){if(bt==NULL)return;else{cout<<bt->data<<" ";PreOrder(bt->lchild);PreOrder(bt->rchild);}}void BiTree::InOrder(BiNode *bt){if(bt==NULL)return;else{InOrder(bt->lchild);cout<<bt->data<<" ";InOrder(bt->rchild);}}void BiTree::PostOrder(BiNode *bt){if(bt==NULL)return;else{PostOrder(bt->lchild);PostOrder(bt->rchild);cout<<bt->data<<" ";}}void BiTree::LevelOrder(){queue<BiNode*>a;BiNode *q;if(root==NULL)return;    a.push(root);while(a.empty()!=true){q=a.front();a.pop();cout<<q->data<<" ";if(q->lchild!=NULL)a.push(q->lchild);if(q->rchild!=NULL)a.push(q->rchild);}}BiNode *BiTree::Creat(BiNode *bt){T ch;cin>>ch;if(ch=='0')bt=NULL;else{bt=new BiNode;bt->data=ch;bt->lchild=Creat(bt->lchild);bt->rchild=Creat(bt->rchild);}return bt;}void BiTree::Release(BiNode *bt){if(bt!=NULL){Release(bt->lchild);Release(bt->rchild);delete bt;}}int main(){BiTree b;b.PreOrder();cout<<endl;b.InOrder();cout<<endl;b.PostOrder();cout<<endl;b.LevelOrder();cout<<endl;}

1 0