#pragma once
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <malloc.h>
typedef char BTDataType;
typedef struct BinaryTreeNode
{
BTDataType _data;
struct BinaryTreeNode* _left;
struct BinaryTreeNode* _right;
}BTNode;
void BinaryLevelOrder(BTNode* root);
int BinaryTreeComplete(BTNode* root);
//层序遍历(利用队列来实现)
void BinaryLevelOrder(BTNode* root)
{
Queue q;
QueueInit(&q);
if (root!=NULL)
{
QueuePush(&q, root);
while (QueueEmpty(&q) != 0)
{
BTNode* front = QueueFront(&q);
printf("%c ", front->_data);
if (front->_left)
{
QueuePush(&q, front->_left);
}
if (front->_right)
{
QueuePush(&q, front->_right);
}
QueuePop(&q);
}
}
}
//判断是否为完全二叉树(利用层序遍历来实现)
int BinaryTreeComplete(BTNode* root)
{
Queue q;
QueueInit(&q);
if (root != NULL)
{
QueuePush(&q, root);
while (QueueEmpty(&q) != 0)
{
BTNode* front = QueueFront(&q);
QueuePop(&q);
if (front == NULL)
{
//ABCDEFG NULL NULL NULL H NULL NULL
break;
}
QueuePush(&q, front->_left);
QueuePush(&q, front->_right);
}
//判断是break跳出循环还是队列为空跳出循环
while (QueueEmpty(&q) != 0)
{
BTNode* front = QueueFront(&q);
if (front != NULL)
{
QueueDestory(&q);
return 0;
}
QueuePop(&q);
}
}
return 1;
}