题目:
问题描述 :
目的:使用C++模板设计并逐步完善二叉树的抽象数据类型(ADT)。
内容:(1)请参照链表的ADT模板,设计二叉树并逐步完善的抽象数据类型。(由于该环境目前仅支持单文件的编译,故将所有内容都集中在一个源文件内。在实际的设计中,推荐将抽象类及对应的派生类分别放在单独的头文件中。参考教材、课件,以及网盘中的链表ADT原型文件,自行设计二叉树的ADT。)
注意:二叉树ADT的基本操作的算法设计很多要用到递归的程序设计方法。
(2)基本操作16:在二叉树的二叉链表存储形式建立的基础上,设计并完成判断二叉树是否为完全二叉树的算法。完成后将其加入到二叉树的ADT基本操作集中。
提示:如果一棵二叉树是完全二叉树,那么按照二叉树的性质5可知,按层编号的最后一个结点的编号等于树上的结点总数。因此,可以层次遍历这棵树。在层次遍历时,对树的每一个结点标记一个数值。标记方法如下:根结点为1。对于每个标记值为n的结点,它的两个孩子结点的标号值分别为2n和2n+1。在遍历时,顺便统计树上的结点个数。当结点数等于最后一个结点的编号时,这棵树是完全二叉树,反之为非完全二叉树。与层次遍历(基本操作5)不同的是,在判断完全二叉树时,队列中不仅要保存指向结点的指针,还需要保存结点的编号。为此在二叉树的数据成员里添加了一个结构体类型作为队列中的元素类型。它的定义如下:
struct elem{
BinaryTreeNode<ElemType> *node;
int num;
};
参考函数原型:
template<class ElemType> 判断是否是完全二叉树
bool BinaryTree<ElemType>::isCompleteTree() const;
输入说明 :
第一行:表示无孩子或指针为空的特殊分隔符
第二行:二叉树的先序序列(结点元素之间以空格分隔)
输出说明 :
第一行:完全二叉树:true
非完全二叉树:false
解题代码:
// tree.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <sstream>
#include <stack>
#include <map>
#include <ctime>
#include <array>
#include <set>
using namespace std;
vector<string> departString_string(string data)
{
vector<int> back_part;//output type
int i, j;
vector<string> part;
string A_part;
stringstream room;
room.str(data);
while (room >> A_part)
part.push_back(A_part);
return part;
}
//————————————————
//版权声明:本文为CSDN博主「systemyff」的原创文章,遵循CC 4.0 BY - SA版权协议,转载请附上原文出处链接及本声明。
//原文链接:https ://blog.csdn.net/u014377763/article/details/113845555
template<class ElemType>
struct tree_point {
ElemType data;//数据
struct tree_point* l_child, * r_child;//左、右孩子指针
};
template<class ElemType>
class BinaryTree {
private:
vector<tree_point<ElemType>*> outlist;
tree_point<ElemType>* root; // 头指针
public:
BinaryTree() :root(NULL)
{
//无参数的构造函数
}
~BinaryTree()
{
//析构函数
}
void BinaryTree_fron(vector<ElemType> lis, ElemType nut)
{
stack<tree_point<ElemType>*> s;
tree_point<ElemType>* p_Parent = NULL, * p_Child = NULL;
int i = 0;
int flag = 0;//控制左右
p_Parent = new tree_point<ElemType>;
p_Parent->data = lis[i];
p_Parent->l_child = p_Parent->r_child = NULL;
s.push(p_Parent);
root = p_Parent;
i = 1;
flag = 0;
while (!s.empty())
{
if (lis[i] != nut)
{
p_Parent = new tree_point<ElemType>;
p_Parent->data = lis[i];
p_Parent->l_child = p_Parent->r_child = NULL;
if (flag == 0)
{
p_Child = s.top();
p_Child->l_child = p_Parent;
}
else if (flag == 1)
{
p_Child = s.top();
s.pop();
p_Child->r_child = p_Parent;
}
s.push(p_Parent);
flag = 0;
}
else
{
if (flag == 0)
flag = 1;
else if (flag == 1)
s.pop();
}
i++;
}
}
tree_point<ElemType>* get_root()
{
return root;
}
void s_qianxu(void)
{
outlist.clear();
if (root == NULL)
return;
tree_point<ElemType>* p = root;
stack<tree_point<ElemType>*> s;
while (!s.empty() || p)
{
while (p)
{
outlist.push_back(p);
s.push(p);
p = p->l_child;
}
if (!s.empty())
{
p = s.top();
s.pop();
p = p->r_child;
}
}
return;
}
void s_zhongxu(void)
{
outlist.clear();
if (root == NULL)
return;
tree_point<ElemType>* p = root;
stack<tree_point<ElemType>*> s;
while (!s.empty() || p)
{
if (p)
{
s.push(p);
p = p->l_child;
}
else
{
p = s.top();
s.pop();
outlist.push_back(p);
p = p->r_child;
}
}
return;
}
void s_houxu(void)
{
if (root == NULL)
return;
stack<tree_point<ElemType>*> s;
//pCur:当前访问节点,pLastVisit:上次访问节点
tree_point<ElemType>* pCur, * pLastVisit;
pCur = root;
pLastVisit = NULL;
while (pCur)
{
s.push(pCur);
pCur = pCur->l_child;
}
while (!s.empty())
{
pCur = s.top();
s.pop();
if (pCur->r_child == NULL || pCur->r_child == pLastVisit)
{
outlist.push_back(pCur);
pLastVisit = pCur;
}
else
{
s.push(pCur);
pCur = pCur->r_child;
while (pCur)
{
s.push(pCur);
pCur = pCur->l_child;
}
}
}
return;
}
void qianxu(tree_point<ElemType>* t)
{
outlist.push_back(t);
if (t->l_child != NULL)
qianxu(t->l_child);
if (t->r_child != NULL)
qianxu(t->r_child);
return;
}
void zhongxu(tree_point<ElemType>* t)
{
if (t->l_child != NULL)
zhongxu(t->l_child);
outlist.push_back(t);
if (t->r_child != NULL)
zhongxu(t->r_child);
return;
}
int two_n(int twoNum)
{
int ans = 1;
while (twoNum--)
ans *= 2;
return ans;
}
void houxu(tree_point<ElemType>* t)
{
if (t->l_child != NULL)
houxu(t->l_child);
if (t->r_child != NULL)
houxu(t->r_child);
outlist.push_back(t);
return;
}
int c_t = 0;
int full_floorTree = 0;
void cengxu(tree_point<ElemType>* t)
{
vector<tree_point<ElemType>* > q;
q.push_back(t);
int last = 1, cur = 0,ceng_num;
while (cur < q.size())
{
ceng_num = 0;
last = q.size();
while (cur < last)
{
outlist.push_back(q[cur]);
if (q[cur]->l_child)
q.push_back(q[cur]->l_child);
if (q[cur]->r_child)
q.push_back(q[cur]->r_child);
++cur;
ceng_num++;
}
c_t++;
if (ceng_num != two_n(c_t-1))
{
full_floorTree ++;
}
}
}
bool floorCheck_full()
{
if (!root)
return 0;
queue<tree_point<ElemType>* > Q;
tree_point<ElemType>* p;
p = root;
Q.push(p);
while (!Q.empty())
{
p = Q.front();
Q.pop();
if (p==NULL)
break;
Q.push(p->l_child);
Q.push(p->r_child);
}
while (!Q.empty())
{
p = Q.front();
Q.pop();
if (p)
return false;
}
return true;
}
void out_lis()
{
int i;
for (i = 0; i < outlist.size(); i++)
{
cout << outlist[i]->data;
if (i != outlist.size() - 1)
cout << ",";
else
cout << endl;
}
outlist.clear();
}
int cnt = 0, p_cnt = 0;
void t_cnt(tree_point<ElemType>* t)
{
p_cnt++;
if (t->l_child != NULL && t->r_child != NULL)
cnt++;
if (t->l_child != NULL)
t_cnt(t->l_child);
if (t->r_child != NULL)
t_cnt(t->r_child);
}
int cengshu()
{
c_t = 0;
cengxu(root);
outlist.clear();
return c_t;
}
int P_cengshu(tree_point<ElemType>* t)
{
c_t = 0;
cengxu(t);
outlist.clear();
return c_t;
}
int twocnt()
{
cnt = 0;
t_cnt(root);
return cnt;
}
int P_twocnt(tree_point<ElemType>* t)
{
cnt = 0;
t_cnt(t);
return cnt;
}
int pointcnt()
{
p_cnt = 0;
t_cnt(root);
return p_cnt;
}
tree_point<ElemType>* father_p;
void find_fatherNow(tree_point<ElemType>* t, ElemType ss)
{
if (t->l_child != NULL)
if (t->l_child->data == ss)
{
father_p = t;
return;
}
if (t->r_child != NULL)
if (t->r_child->data == ss)
{
father_p = t;
return;
}
if (t->l_child != NULL)
find_fatherNow(t->l_child, ss);
if (t->r_child != NULL)
find_fatherNow(t->r_child, ss);
return;
}
tree_point<ElemType>* find_father(tree_point<ElemType>* t, ElemType ss)
{
father_p = NULL;
find_fatherNow(t, ss);
return father_p;
}
tree_point<ElemType>* nas_p;
void find_selfNOW(tree_point<ElemType>* t, ElemType ss)
{
if (t->data == ss)
nas_p = t;
if (t->l_child != NULL)
find_selfNOW(t->l_child, ss);
if (t->r_child != NULL)
find_selfNOW(t->r_child, ss);
return;
}
tree_point<ElemType>* find_self(tree_point<ElemType>* t, ElemType ss)
{
nas_p = NULL;
find_selfNOW(t, ss);
return nas_p;
}
void fast_delChild(tree_point<ElemType>* t, bool flag)
{
if (flag == 0)
t->l_child = NULL;
else
t->r_child = NULL;
return;
}
void slow_delChild(tree_point<ElemType>* t, bool flag)
{
if (flag == 0)
t->l_child = NULL;
else
t->r_child = NULL;
return;
}
bool is_same = 1;
bool check_same(tree_point<ElemType>* t1, tree_point<ElemType>* t2)
{
if (((t1->l_child != NULL && t2->l_child != NULL) || (t1->l_child == NULL && t2->l_child == NULL))
&& ((t1->r_child != NULL && t2->r_child != NULL) || (t1->r_child == NULL && t2->r_child == NULL))
&& t1->data == t2->data)
{
if (t1->l_child != NULL)
check_same(t1->l_child,t2->l_child);
if (t1->r_child != NULL)
check_same(t1->r_child, t2->r_child);
}
else
{
is_same = 0;
return 0;
}
}
bool operator==(BinaryTree B2)
{
is_same = 1;
check_same(root, B2.get_root());
return is_same;
}
};
int main()
{
string s, ins, ins1, nulls;
vector<string> part_in, part_in1;
BinaryTree<string> a;
/*BinaryTree<string> b;*/
cin >> nulls;
cin.get();
getline(cin, ins);
part_in = departString_string(ins);
a.BinaryTree_fron(part_in, nulls);
if (a.floorCheck_full())
cout << "true" << endl;
else
cout << "false" << endl;
return 0;
}