剑指offer——面试题32.1：分行从上到下打印二叉树

void BFSLayer(BinaryTreeNode* pRoot)
{
    if(pRoot==nullptr)
        return;
    queue<BinaryTreeNode*> pNode;
    int curLayer=1,nextLayer=0;
    pNode.push(pRoot);
    while(!pNode.empty())
    {
        BinaryTreeNode* pFront=pNode.front();
        cout<<pFront->m_Value<<' ';
        pNode.pop();
        curLayer--;
        if(pFront->m_pLeft!=nullptr)
        {
            nextLayer++;
            pNode.push(pFront->m_pLeft);
        }
        if(pFront->m_pRight!=nullptr)
        {
            nextLayer++;
            pNode.push(pFront->m_pRight);
        }
        if(curLayer==0)
        {
            curLayer=nextLayer;
            nextLayer=0;
            cout<<endl;
        }
    }
}

#include"BinaryTree.h"

// ====================测试代码====================
//            8
//        6      10
//       5 7    9  11
void Test1()
{
    BinaryTreeNode* pNode8 = CreateBinaryTreeNode(8);
    BinaryTreeNode* pNode6 = CreateBinaryTreeNode(6);
    BinaryTreeNode* pNode10 = CreateBinaryTreeNode(10);
    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);
    BinaryTreeNode* pNode7 = CreateBinaryTreeNode(7);
    BinaryTreeNode* pNode9 = CreateBinaryTreeNode(9);
    BinaryTreeNode* pNode11 = CreateBinaryTreeNode(11);

    ConnectTreeNodes(pNode8, pNode6, pNode10);
    ConnectTreeNodes(pNode6, pNode5, pNode7);
    ConnectTreeNodes(pNode10, pNode9, pNode11);

    printf("====Test1 Begins: ====
");
    printf("Expected Result is:
");
    printf("8 
");
    printf("6 10 
");
    printf("5 7 9 11 

");

    printf("Actual Result is: 
");
    BFSLayer(pNode8);
    printf("
");

    DestroyTree(pNode8);
}

//            5
//          4
//        3
//      2
void Test2()
{
    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);
    BinaryTreeNode* pNode4 = CreateBinaryTreeNode(4);
    BinaryTreeNode* pNode3 = CreateBinaryTreeNode(3);
    BinaryTreeNode* pNode2 = CreateBinaryTreeNode(2);

    ConnectTreeNodes(pNode5, pNode4, nullptr);
    ConnectTreeNodes(pNode4, pNode3, nullptr);
    ConnectTreeNodes(pNode3, pNode2, nullptr);

    printf("====Test2 Begins: ====
");
    printf("Expected Result is:
");
    printf("5 
");
    printf("4 
");
    printf("3 
");
    printf("2 

");

    printf("Actual Result is: 
");
    BFSLayer(pNode5);
    printf("
");

    DestroyTree(pNode5);
}

//        5
//         4
//          3
//           2
void Test3()
{
    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);
    BinaryTreeNode* pNode4 = CreateBinaryTreeNode(4);
    BinaryTreeNode* pNode3 = CreateBinaryTreeNode(3);
    BinaryTreeNode* pNode2 = CreateBinaryTreeNode(2);

    ConnectTreeNodes(pNode5, nullptr, pNode4);
    ConnectTreeNodes(pNode4, nullptr, pNode3);
    ConnectTreeNodes(pNode3, nullptr, pNode2);

    printf("====Test3 Begins: ====
");
    printf("Expected Result is:
");
    printf("5 
");
    printf("4 
");
    printf("3 
");
    printf("2 

");

    printf("Actual Result is: 
");
    BFSLayer(pNode5);
    printf("
");

    DestroyTree(pNode5);
}

void Test4()
{
    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);

    printf("====Test4 Begins: ====
");
    printf("Expected Result is:
");
    printf("5 

");

    printf("Actual Result is: 
");
    BFSLayer(pNode5);
    printf("
");

    DestroyTree(pNode5);
}

void Test5()
{
    printf("====Test5 Begins: ====
");
    printf("Expected Result is:
");

    printf("Actual Result is: 
");
    BFSLayer(nullptr);
    printf("
");
}

//        100
//        /
//       50
//         
//         150
void Test6()
{
    BinaryTreeNode* pNode100 = CreateBinaryTreeNode(100);
    BinaryTreeNode* pNode50 = CreateBinaryTreeNode(50);
    BinaryTreeNode* pNode150 = CreateBinaryTreeNode(150);

    ConnectTreeNodes(pNode100, pNode50, nullptr);
    ConnectTreeNodes(pNode50, nullptr, pNode150);

    printf("====Test6 Begins: ====
");
    printf("Expected Result is:
");
    printf("100 
");
    printf("50 
");
    printf("150 

");

    printf("Actual Result is: 
");
    BFSLayer(pNode100);
    printf("
");
}

int main(int argc, char* argv[])
{
    Test1();
    Test2();
    Test3();
    Test4();
    Test5();
    Test6();

    return 0;
}