iframe-proxy | Sunbelt Computer Software

265 lines (216 loc) · 5.62 KB
/* ====================================================
#   Copyright (C)2019 All rights reserved.
#   Author        : julian Andrison
#   Email         : 15544925950@163.com
#   File Name     : main.cpp
#   Last Modified : 2019-08-03 09:27
#   Describe      :
# ====================================================*/
#include <iostream>
#include <vector>
#include <queue>
#include "../Utilities/BinaryTree.h"
using namespace std;
void Print(BinaryTreeNode* pRoot)
    if(pRoot == nullptr)return;
    BinaryTreeNode* node = pRoot;
    queue<BinaryTreeNode*> array;
    array.push(node);
    int cur = 1;
    int next = 0;
    while(array.size() > 0)
	BinaryTreeNode* p = array.front();
	array.pop();
	cout << p->m_nValue << " " ;
	if(p->m_pLeft != nullptr) 
	    array.push(p->m_pLeft);
	    next++;
	if(p->m_pRight != nullptr)
	    array.push(p->m_pRight);
	    next++;
	if(cur == 0)
	    cur = next;
	    next = 0;
	    cout << endl;
// void Sub_Print(vector<BinaryTreeNode*> array, int* num)
//     int index = 0;
//     int step = 0;
//     while(num[index] != 0)
//         for(int i=0; i<num[index]; i++)
//         {
//             cout << array[i+step]->m_nValue << "  ";
//         }
//         step += num[index];
//         cout << endl;
//         index++;
// void Print(BinaryTreeNode* pRoot)
//     if(pRoot == nullptr) return;
//     vector<BinaryTreeNode*> Array;
//     int num[100] = {0};
//     num[0] = 1; // 一层里结点的数量
//     Array.push_back(pRoot);
//     int index = 0; // 层
//     int step = 0; //当前遍历到的结点　
//     while(num[index] != 0)
//         int tmp = index;
//         index++;
//         for(int i=0; i<num[tmp]; i++) // 遍历当前层每个结点，有子节点就放在Array后面,同时更新当前层结点数
//         {
//             if(Array[step]->m_pLeft != nullptr)
//                 Array.push_back(Array[step]->m_pLeft);
//                 num[index]++;
//             if(Array[step]->m_pRight != nullptr)
//                 Array.push_back(Array[step]->m_pRight);
//                 num[index]++;
//             step++;
//         }
//     Sub_Print(Array, num); // 打印
// ==================== Test Code ====================
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: ====\n");
    printf("Expected Result is:\n");
    printf("8 \n");
    printf("6 10 \n");
    printf("5 7 9 11 \n\n");
    printf("Actual Result is: \n");
    Print(pNode8);
    printf("\n");
    DestroyTree(pNode8);
void Test2()
    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);
    BinaryTreeNode* pNode4 = CreateBinaryTreeNode(4);
    BinaryTreeNode* pNode3 = CreateBinaryTreeNode(3);
    BinaryTreeNode* pNode2 = CreateBinaryTreeNode(2);
    ConnectTreeNodes(pNode5, pNode4, NULL);
    ConnectTreeNodes(pNode4, pNode3, NULL);
    ConnectTreeNodes(pNode3, pNode2, NULL);
    printf("====Test2 Begins: ====\n");
    printf("Expected Result is:\n");
    printf("5 \n");
    printf("4 \n");
    printf("3 \n");
    printf("2 \n\n");
    printf("Actual Result is: \n");
    Print(pNode5);
    printf("\n");
    DestroyTree(pNode5);
void Test3()
    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);
    BinaryTreeNode* pNode4 = CreateBinaryTreeNode(4);
    BinaryTreeNode* pNode3 = CreateBinaryTreeNode(3);
    BinaryTreeNode* pNode2 = CreateBinaryTreeNode(2);
    ConnectTreeNodes(pNode5, NULL, pNode4);
    ConnectTreeNodes(pNode4, NULL, pNode3);
    ConnectTreeNodes(pNode3, NULL, pNode2);
    printf("====Test3 Begins: ====\n");
    printf("Expected Result is:\n");
    printf("5 \n");
    printf("4 \n");
    printf("3 \n");
    printf("2 \n\n");
    printf("Actual Result is: \n");
    Print(pNode5);
    printf("\n");
    DestroyTree(pNode5);
void Test4()
    BinaryTreeNode* pNode5 = CreateBinaryTreeNode(5);
    printf("====Test4 Begins: ====\n");
    printf("Expected Result is:\n");
    printf("5 \n\n");
    printf("Actual Result is: \n");
    Print(pNode5);
    printf("\n");
    DestroyTree(pNode5);
void Test5()
    printf("====Test5 Begins: ====\n");
    printf("Expected Result is:\n");
    printf("Actual Result is: \n");
    Print(NULL);
    printf("\n");
//        /
//         \
void Test6()
    BinaryTreeNode* pNode100 = CreateBinaryTreeNode(100);
    BinaryTreeNode* pNode50 = CreateBinaryTreeNode(50);
    BinaryTreeNode* pNode150 = CreateBinaryTreeNode(150);
    ConnectTreeNodes(pNode100, pNode50, NULL);
    ConnectTreeNodes(pNode50, NULL, pNode150);
    printf("====Test6 Begins: ====\n");
    printf("Expected Result is:\n");
    printf("100 \n");
    printf("50 \n");
    printf("150 \n\n");
    printf("Actual Result is: \n");
    Print(pNode100);
    printf("\n");
int main(int argc, char* argv[])
    Test1();
    Test2();
    Test3();
    Test4();
    Test5();
    Test6();
Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Sunbelt Computer Software

PL/B Language Development and Support

FilesExpand file tree

main.cpp

Latest commit

History

main.cpp

File metadata and controls
