求一個用C++實作的遞回的二叉樹類
uj5u.com熱心網友回復：
#include <iostream>#include <stdlib.h>
using namespace std;
struct BiTreeNode
{
char data;
struct BiTreeNode *rchild,*lchild;
};
class BiTree
{
public:
void Create(struct BiTreeNode *);
void Display();
};
void BiTree::Create(struct BiTreeNode *Tnode)
{
char ch;
cin>>ch;
if(ch==' ')//空格表示空樹
{
Tnode=NULL;
}
else
{
Tnode=(struct BiTreeNode *)malloc(sizeof(struct BiTreeNode));
Tnode->data=https://bbs.csdn.net/topics/ch;
Create(Tnode->lchild);
Create(Tnode->rchild);
}
cout<<"Create Complated!"<<endl;
}
int main()
{
struct BiTreeNode *Tnode;
BiTree BT1;
BT1.Create(Tnode);
return 0;
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/120979.html
標籤：基礎類