5.1.12—二叉树的遍历—Populating Next Right Pointers in Ea Node II

描述
Follow up for problem ”Populating Next Right Pointers in Each Node”.
What if the given tree could be any binary tree? Would your previous solution still work?
Note: You may only use constant extra space.
For example, Given the following binary tree,
1
/ \
2 3
/ \ \
4 5 7
Aer calling your function, the tree should look like:
1 -> NULL
/ \
2 -> 3 -> NULL
/ \ \

4-> 5 -> 7 -> NULL

#pragma once
#include<iostream>
struct BinaryTreeNode
{
	int                    m_nValue;
	BinaryTreeNode*        m_pLeft;
	BinaryTreeNode*        m_pRight;
};

BinaryTreeNode* CreateBinaryTreeNode(int value);
void ConnectTreeNodes(BinaryTreeNode* pParent, BinaryTreeNode* pLeft, BinaryTreeNode* pRight);
void PrintTreeNode(BinaryTreeNode* pNode);
void PrintTree(BinaryTreeNode* pRoot);
void DestroyTree(BinaryTreeNode* pRoot);

#include "BinaryTree.h"

BinaryTreeNode* CreateBinaryTreeNode(int value)
{
	BinaryTreeNode* pNode = new BinaryTreeNode();
	pNode->m_nValue = value;
	pNode->m_pLeft = NULL;
	pNode->m_pRight = NULL;
	return pNode;
}

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

void PrintTreeNode(BinaryTreeNode* pNode)
{
	if (pNode != NULL)
	{
		printf("value of this node is: %d\n", pNode->m_nValue);

		if (pNode->m_pLeft != NULL)
			printf("value of its left child is: %d.\n", pNode->m_pLeft->m_nValue);
		else
			printf("left child is null.\n");

		if (pNode->m_pRight != NULL)
			printf("value of its right child is: %d.\n", pNode->m_pRight->m_nValue);
		else
			printf("right child is null.\n");
	}
	else
	{
		printf("this node is null.\n");
	}

	printf("\n");
}

void PrintTree(BinaryTreeNode* pRoot)
{
	PrintTreeNode(pRoot); 

	if (pRoot != NULL)
	{
		if (pRoot->m_pLeft != NULL)
			PrintTree(pRoot->m_pLeft);

		if (pRoot->m_pRight != NULL)
			PrintTree(pRoot->m_pRight);
	}
}

void DestroyTree(BinaryTreeNode* pRoot)
{
	if (pRoot != NULL)
	{
		BinaryTreeNode* pLeft = pRoot->m_pLeft;
		BinaryTreeNode* pRight = pRoot->m_pRight;

		delete pRoot;
		pRoot = NULL;

		DestroyTree(pLeft);
		DestroyTree(pRight);
	}
}

#include "BinaryTree.h"
#include <stack>
#include<queue>
#include<vector>
using namespace std;
//===二叉树的层次遍历
vector<vector<int>> LevelTraversal(BinaryTreeNode *proot)
{
	queue<BinaryTreeNode*>temp;
	vector<int> tempres;//记录所有数字
	vector<int> num;//记录每一层的个数

	temp.push(proot);
	int Initial = 1;
	num.push_back(Initial);

	while (!temp.empty())
	{
		int cnt = 0;
		for (int i = 0; i < Initial; i++)
		{
			BinaryTreeNode *p = temp.front();
			tempres.push_back(p->m_nValue);
			temp.pop();
			if (p->m_pLeft)
			{
				temp.push(p->m_pLeft);
				cnt++;
			}
			if (p->m_pRight)
			{
				temp.push(p->m_pRight);
				cnt++;
			}
		}
		Initial = cnt;
		if (Initial!=0)
			num.push_back(Initial);
	}
	//====================
	vector<vector<int>> res;
	int cnt = 0;
	for (int i = 0; i < num.size();i++)
	{
		vector<int> cahe;
		for (int j =cnt; j < cnt+num[i]; j++)
			cahe.push_back(tempres[j]);
		
		cnt += num[i];
		res.push_back(cahe);
	}
	return res;
}
// ====================测试代码====================
//            8
//        6      10
//       5 7    9  11
int main()
{
	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);
	//===
	//PrintTree(pNode8);
	//===
	vector<vector<int>> res = LevelTraversal(pNode8);
	for (int i = 0; i < res.size(); i++)
	{
		for (int j = 0; j < res[i].size(); j++)
			cout << res[i][j] << " ";
		cout << endl;
	}

	DestroyTree(pNode8);
}