面试题31: 栈的压入、弹出序列

Github

/*******************************************************************
/*******************************************************************
*《剑指Offer——名企面试官精讲典型编程题》C++代码
*
* htfeng
* 2018.10.06
*
* 面试题32: 从上到下打印二叉树
* 题目一：不分行打印(PrintFromTopToBottom)
* 题目二：分行从上到下打印二叉树(print)
* 题目三: 之字形打印二叉树(两个栈，分别存储奇偶层节点)
*
* 分析： 层序遍历
*******************************************************************/
#include<queue>
#include<iostream>
#include<stack>

struct BinaryTreeNode {
	int m_mValue;
	BinaryTreeNode* m_pLeft;
	BinaryTreeNode* m_pRight;
};

class Solution {
public:
	// 不分行打印
	void PrintFromTopToBottom(BinaryTreeNode* pTreeRoot) {
		if (!pTreeRoot)
			return;

		std::queue<BinaryTreeNode *> dequeTreeNode;

		dequeTreeNode.push(pTreeRoot);
		while (dequeTreeNode.size()) {
			BinaryTreeNode* pNode = dequeTreeNode.front();
			dequeTreeNode.pop();
			std::cout << pNode->m_mValue;

			if (pNode->m_pLeft)
				dequeTreeNode.push(pNode->m_pLeft);

			if (pNode->m_pRight)
				dequeTreeNode.push(pNode->m_pRight);

		}
	}
	// 分行打印
	void print(BinaryTreeNode* pRoot) {
		if (pRoot = nullptr)
			return;

		std::queue<BinaryTreeNode *> nodes;
		nodes.push(pRoot);
		int nextLevel = 0;
		int toBePrinted = 1;
		while (!nodes.empty()) {
			BinaryTreeNode* pNode = nodes.front();
			std::cout << pNode->m_mValue;

			if (pNode->m_pLeft != nullptr) {
				nodes.push(pNode->m_pLeft);
				++nextLevel;
			}
			if (pNode->m_pRight != nullptr) {
				nodes.push(pNode->m_pRight);
				++nextLevel;
			}

			nodes.pop();
			--toBePrinted;
			if (toBePrinted == 0) {
				std::cout << std::endl;
				toBePrinted = nextLevel;
				nextLevel = 0;
			}
		}
	}

	// 之字形打印二叉树
	void PrintOfZigzag(BinaryTreeNode* pRoot) {
		if (pRoot == nullptr)
			return;

		std::stack<BinaryTreeNode *>levels[2];
		int current = 0;
		int next = 1;

		levels[current].push(pRoot);
		while (!levels[0].empty() || !levels[1].empty()) {
			BinaryTreeNode* pNode = levels[current].top();
			levels[current].pop();

			if (current == 0) {
				if (pNode->m_pLeft != nullptr)
					levels[next].push(pNode->m_pLeft);
				if (pNode->m_pRight != nullptr)
					levels[next].push(pNode->m_pRight);
			}
			else {
				if (pNode->m_pRight != nullptr)
					levels[next].push(pNode->m_pRight);
				if (pNode->m_pLeft != nullptr)
					levels[next].push(pNode->m_pLeft);
			}

			if (levels[current].empty()) {
				std::cout << std::endl;
				current = 1 - current;
				next = 1 - next;
			}
		}
	}
};