剑指offer系列（59）按之字形顺序打印二叉树

解题思路：层序遍历时，判断当前层数，若为奇数层，则反转当前层的结果，再保存。

class Solution {
public:
    vector<vector<int> > Print(TreeNode* pRoot) {
		vector<vector<int>> res;
		queue<TreeNode*> que;
		if (pRoot == nullptr)		return res;
		
		int level_num = 0;
		que.push(pRoot);
		while (!que.empty()){
			int size = que.size();
			vector<int> level;
		
			for (int i = 0; i < size; i++){
				TreeNode* node = que.front();	que.pop();
				level.push_back(node->val);

				if (node->left)		que.push(node->left);
				if (node->right)	que.push(node->right);
			}
			if (level_num++ % 2 == 1)		reverse(level.begin(), level.end());
			res.push_back(level);			
		}
		return res;
	}
}

执行结果