左神算法基础class4—题目7-2判断一棵树是否是完全二叉树
1.题目:判断一棵树是否是完全二叉树
2.预备知识:按层遍历
由于判断完全二叉树需要使用层序遍历,先讲解下层序遍历,上图按层遍历的结果是5,3,8,2,4,6,10,7
(1)思路
使用队列进行存储,头节点先入队列,在队列不空的情况下将队首节点的左右孩子分别入队列,再将队首出队列。
(2)核心代码
void SeqTraverse(Tree *head)
{
queue<Tree*> t;
if(head == NULL)
return;
t.push(head);//头节点进队列
while(!t.empty())
{
head = t.front();
cout<<t.front()->val<<" ";
//队首的左右孩子入队列
if(head->left!=NULL)
t.push(head->left);
if(head->right!=NULL)
t.push(head->right);
t.pop();
}
}
(3)完整代码
#include<iostream>
#include<queue>
using namespace std;
//结构体定义
class Tree
{
public:
int val;
Tree *left;
Tree *right;
Tree(int x){
this->val = x;
this->left = NULL;
this->right = NULL;
}
};
//按层遍历
void SeqTraverse(Tree *head)
{
queue<Tree*> t;
if(head == NULL)
return;
t.push(head);//头节点进队列
while(!t.empty())
{
head = t.front();
cout<<t.front()->val<<" ";
//队首的左右孩子入队列
if(head->left!=NULL)
t.push(head->left);
if(head->right!=NULL)
t.push(head->right);
t.pop();//出队
}
}
int main()
{
Tree *head = new Tree(5);
head->left = new Tree(3);
head->left->left = new Tree(2);
head->left->right = new Tree(4);
head->right = new Tree(8);
head->right->left = new Tree(6);
head->right->right = new Tree(10);
head->right->left->right= new Tree(7);
SeqTraverse(head);
system("pause");
return 0;
}
3.判断完全二叉树
(1)思路
整体思路是如果树为空,则直接返回true,如果树不为空,则对每个节点按层序遍历
①若当前节点有右子树无左子树一定不是完全二叉树
②如果一个节点,不是左右孩子都全(左孩子不为空,右孩子为空;或者左右孩子都为空)则该节点之后的节点都为叶子节点(无左右孩子)。
完全满足①②才是完全二叉树。
(2)核心代码
把上述②即左右孩子不全时,视为开启判断叶子节点阶段,使用leaf布尔变量表示1开启,2不开启。总的来说有两种情况直接返回false:进入判断叶子阶段后如果head->left != NULL || head->right != NULL
时表示存在左右孩子,不是叶子节点,返回false,此外在head->left == NULL && head->right != NULL
情况下,即右存在左不存在时也返回false。下面代码将两者合并在一起
//开启叶子节点阶段后,若后续节点不是叶子节点返回false
//没开启时,右孩子有左孩子无,返回false
if(leaf && (head->left != NULL || head->right != NULL)
||
head->left == NULL && head->right != NULL)
return false;
什么时候开启叶子节点阶段?
左右孩子一共有四种情况,A左有右有,B左有右无,C左无右有,D左无右无。A情况正常入队列,C情况不是二叉树,B,D情况进入判断叶子节点阶段
把B,D情况可以写成if(head->left == NULL || head->right == NULL)
,也可以归纳为在右不存在的情况下进入判断叶子节点阶段
if(head->right != NULL)
q.push(head->right);
else //等价于if(head->left == NULL || head->right == NULL)
leaf = true;
整体判断完全二叉树函数如下:
bool isCBT(Tree *head)
{
if(head == NULL)
return true;
queue<Tree *>q;
bool leaf = false;
q.push(head);
while(!q.empty())
{
head = q.front();
//开启叶子节点阶段后,若后续节点不是叶子节点返回false
//没开启时,右孩子有左孩子无,返回false
if(leaf && (head->left != NULL || head->right != NULL)
||
head->left == NULL && head->right != NULL)
return false;
if(head->left != NULL)
q.push(head->left);
if(head->right != NULL)
q.push(head->right);
else //等价于if(head->left == NULL || head->right == NULL)
leaf = true;
q.pop();
}
return true;
}
(3)完整代码
#include<iostream>
#include<queue>
using namespace std;
class Tree
{
public:
int val;
Tree *left;
Tree *right;
Tree(int x){
this->val = x;
this->left = NULL;
this->right = NULL;
}
};
bool isCBT(Tree *head)
{
if(head == NULL)
return true;
queue<Tree *>q;
bool leaf = false;
q.push(head);
while(!q.empty())
{
head = q.front();
//开启叶子节点阶段后,若后续节点不是叶子节点返回false
//没开启时,右孩子有左孩子无,返回false
if(leaf && (head->left != NULL || head->right != NULL)
||
head->left == NULL && head->right != NULL)
return false;
if(head->left != NULL)
q.push(head->left);
if(head->right != NULL)
q.push(head->right);
else //等价于if(head->left == NULL || head->right == NULL)
leaf = true;
q.pop();
}
return true;
}
int main()
{
Tree *head = new Tree(5);
head->left = new Tree(3);
head->left->left = new Tree(2);
head->left->right = new Tree(4);
head->right = new Tree(8);
head->right->left = new Tree(6);
head->right->right = new Tree(10);
//test
head->right->left->left= new Tree(7);
head->right->left->right= new Tree(7);
//head->right->right->left= new Tree(7);
//head->right->right->right= new Tree(7);
head->left->left->left= new Tree(7);
head->left->left->right= new Tree(7);
head->left->right->left= new Tree(7);
head->left->right->right= new Tree(7);
cout<<isCBT(head);
system("pause");
return 0;
}