判断一棵树是否是满二叉树

最新推荐文章于 2023-07-07 00:00:18 发布

我要取一个不会重复的名字

最新推荐文章于 2023-07-07 00:00:18 发布

阅读量4.5k

点赞数 1

文章标签： c++ 满二叉树非递归

本文链接：https://blog.csdn.net/weixin_41767070/article/details/94149267

版权

满二叉树即为二叉树所有层都是满的，每一个节点都有左右孩子，除了叶节点。

#include <iostream>
#include <queue>
using namespace std;
struct TreeNode
{
	int val;
	TreeNode* left;
	TreeNode* right;
	TreeNode(int a) :val(a), left(NULL), right(NULL) {};
};

bool isfullTree(TreeNode * p)
{
	if (p == NULL)return true;
	//Judging the number of layers and nodes if a Binary Tree
	queue<TreeNode*>help;
	help.push(p);
	TreeNode *end = p;
	TreeNode *next = NULL;
	int numNodes = 0;
	int numLayers = 0;
	while (!help.empty()) {
		p = help.front();
		help.pop();
		numNodes++;
		if (p->left != NULL) {
			help.push(p->left);
			next = p->left;
		}
		if (p->right != NULL) {
			help.push(p->right);
			next = p->right;
		}
		if (p == end) {
			end = next;
			next = NULL;
			numLayers++;
		}
	}
	if (numNodes == pow(2, numLayers) - 1)return true;
	else
		return false;