文章
55
粉丝
317
获赞
160
访问
32.9k
#include<iostream>
#include<string>
using namespace std;
struct TNode
{
char data;
TNode* rchild, * lchild;
};
void BuildTree(string str,int index, struct TNode* &root)
{
if (index >= str.size()) return;
if (str[index] == '#') { root = NULL;return; }
root = new struct TNode;
root->data = str[index];
root->lchild = NULL;
root->rchild = NULL;
BuildTree(str, index * 2, root->lchild);
BuildTree(str, index * 2+1, root->rchild);
return;
}
//用于判断是否对称
bool Judge(TNode* lchild, TNode* rchild)
{
if (!lchild && !rchild)return true;
if (lchild && rchild) return Judge(lchild->lchild, rchild->rchild) && Judge(lchild->rchild, rchild->lch...
登录后发布评论
暂无评论,来抢沙发