#include <iostream>
#include <deque>
using namespace std;
struct BTree
{
BTree* pLeft;
BTree* pRight;
int value;
};
void InsertBTree(BTree* &pRoot,int n)
{
if(!pRoot)
{
pRoot=new BTree;
pRoot->pLeft=NULL;
pRoot->pRight=NULL;
pRoot->value=n;
}
else
{
if (n>pRoot->value)
{
InsertBTree(pRoot->pRight,n);
}
if (n<pRoot->value)
{
InsertBTree(pRoot->pLeft,n);
}
if (n==pRoot->value)
{
cout<<"repeated insertion"<<endl;
}
}
}
void VisitByLevel(BTree* root)
{
if (!root)
{
return;
}
deque<BTree*> BTDeque; //创建一个双向队列,把每一层的子树从左到右的压入。
BTDeque.push_back(root);
while (BTDeque.size())
{
BTree* cur = BTDeque.front();
cout<<cur->value<<" ";
BTDeque.pop_front();
if (cur->pLeft != NULL)
{
BTDeque.push_back(cur->pLeft);
}
if (cur->pRight != NULL)
{
BTDeque.push_back(cur->pRight);
}
}
}
//level为层次数,从根节点一层一层遍历,直到要打印输出的层次。
int printNodeAtLevel(BTree* root, int level)
{
if (root == NULL || level == 0)
{
return 0;
}
if (level == 0)
{
cout<<root->value<<" ";
}
printNodeAtLevel(root->pLeft, level-1);
printNodeAtLevel(root->pRight, level-1);
}
int main()
{
BTree* pRoot=NULL;
InsertBTree(pRoot,8);
InsertBTree(pRoot,6);
InsertBTree(pRoot,10);
InsertBTree(pRoot,5);
InsertBTree(pRoot,7);
InsertBTree(pRoot,9);
InsertBTree(pRoot,11);
VisitByLevel(pRoot);
cout<<endl;
printNodeAtLevel(pRoot, 2);
return 0;
}
层序遍历二叉树&打印其中一层
最新推荐文章于 2022-06-29 18:15:28 发布
这篇博客介绍了如何实现二叉树的层序遍历,并提供了一个函数用于按层次打印二叉树的节点。示例代码展示了如何插入节点并进行层序遍历以及在给定层次打印节点。
摘要由CSDN通过智能技术生成