实现一棵二叉树的层序遍历

最新推荐文章于 2021-10-28 09:17:42 发布

dcjhyn

最新推荐文章于 2021-10-28 09:17:42 发布

阅读量223

点赞数 1

分类专栏： C++ 二叉树遍历文章标签：二叉树遍历层序遍历二叉树

本文链接：https://blog.csdn.net/dcjhyn/article/details/75808282

版权

C++ 同时被 2 个专栏收录

23 篇文章 0 订阅

订阅专栏

二叉树遍历

2 篇文章 0 订阅

订阅专栏

BinaryTree.h

#pragma once
#include <iostream>
#include<deque>
using namespace std;

struct BinaryTreeNode
{
    int _value;
    BinaryTreeNode* _pLeft;
    BinaryTreeNode* _pRight;
};

PrintBinaryTree.cpp

#include"BinaryTree.h"


void PrintFromTopToBottom(BinaryTreeNode* pTreeRoot)
{
    if (!pTreeRoot)
        return ;

    deque<BinaryTreeNode*> dequeTreeNode;
    dequeTreeNode.push_back(pTreeRoot);

    while (dequeTreeNode.size())
    {
        BinaryTreeNode* pNode = dequeTreeNode.front();
        cout<<pNode->_value;
        dequeTreeNode.pop_front();

        if (pNode->_pLeft)
            dequeTreeNode.push_back(pNode->_pLeft);
        if (pNode->_pRight)
            dequeTreeNode.push_back(pNode->_pRight);
    }
}

void ConnectTreeNodes(BinaryTreeNode* pParent, BinaryTreeNode* pLeft, BinaryTreeNode* pRight)
{
    if(pParent != NULL)
    {
        pParent->_pLeft = pLeft;
        pParent->_pRight = pRight;
    }
}

BinaryTreeNode* CreateBinaryTreeNode(int value)
{
    BinaryTreeNode* pNode = new BinaryTreeNode();
    pNode->_value = value;
    pNode->_pLeft = NULL;
    pNode->_pRight = NULL;

    return pNode;
}

void test()
{
    BinaryTreeNode* pNode10 = CreateBinaryTreeNode(10);
    BinaryTreeNode* pNode6 = CreateBinaryTreeNode(6);
    BinaryTreeNode* pNode14 = CreateBinaryTreeNode(14);
    BinaryTreeNode* pNode4 = CreateBinaryTreeNode(4);
    BinaryTreeNode* pNode8 = CreateBinaryTreeNode(8);
    BinaryTreeNode* pNode12 = CreateBinaryTreeNode(12);
    BinaryTreeNode* pNode16 = CreateBinaryTreeNode(16);

    ConnectTreeNodes(pNode10, pNode6, pNode14);
    ConnectTreeNodes(pNode6, pNode4, pNode8);
    ConnectTreeNodes(pNode14, pNode12, pNode16);

    PrintFromTopToBottom(pNode10);
}

int main()
{
    test();
    return 0;
}