void _BTreeLevelOrder(BTNode* root, size_t i)
{
if (root == NULL || i == 0)
{
return;
}
if (i == 1)
{
printf("%d ", root->_data);
return;
}
_BTreeLevelOrder(root->_left, i - 1);
_BTreeLevelOrder(root->_right, i - 1);
}
void BTreeLevelOrder(BTNode* root)
{
if (root == NULL)
return;
int dep = BTreeDepth(root);
for (int i = 1; i <= dep; i++)
{
_BTreeLevelOrder(root, i);
}
}
void BTreeLevelOrderNonR(BTNode* root)
{
Queue q;
QueueInit(&q);
if (root)
QueuePush(&q, root);
while (QueueEmpty(&q) != 0)
{
BTNode* front = QueueFront(&q);
printf("%d ", front->_data);
QueuePop(&q);
if (front->_left)
{
QueuePush(&q, front->_left);
}
if (front->_right)
{
QueuePush(&q, front->_right);
}
}
printf("\n");
}
int IsCompleteBTree1(BTNode* root)
{
Queue q;
QueueInit(&q);
if (root)
QueuePush(&q, root);
while (QueueEmpty(&q) != 0)
{
BTNode* front = QueueFront(&q);
QueuePop(&q);
if (front == NULL)
{
break;
}
else
{
QueuePush(&q, front->_left);
QueuePush(&q, front->_right);
}
}
while (QueueEmpty(&q) != 0)
{
BTNode* front = QueueFront(&q);
if (front)
{
return 0;
}
QueuePop(&q);
}
return 1;
}
int IsCompleteBTree2(BTNode* root)
{
Queue q;
QueueInit(&q);
if (root)
QueuePush(&q, root);
int flag = 1;
while (QueueEmpty(&q) != 0)
{
BTNode* front = QueueFront(&q);
QueuePop(&q);
if (front->_left)
{
if (flag == 0)
{
return 0;
}
QueuePush(&q, front->_left);
}
else
flag = 0;
if (front->_right)
{
if (flag == 0)
{
return 0;
}
QueuePush(&q, front->_right);
}
else
flag = 0;
}
return 1;
}
关于队列的操做:
https://github.com/canglaodexiaohai/data-structure/blob/master/%E9%98%9F%E5%88%97git