剑指offer - 60把二叉树打印成多行

题目描述

从上到下按层打印二叉树，同一层结点从左至右输出。每一层输出一行。

思路如下：

使用层次遍历即可

代码如下：

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
class Solution {
public:
    //层次遍历
    vector<vector<int> > level_print(TreeNode* pRoot) {
        vector<vector<int> > result;
        queue<TreeNode*> nodequeue;
        nodequeue.push(pRoot);
        while(!nodequeue.empty()){
            vector<int> layer;
            int layersize = nodequeue.size();  //先保存一层的大小
            for(int i = 0; i < layersize; i++){
                TreeNode* node = nodequeue.front();
                nodequeue.pop();
                if(node){
                    layer.push_back(node->val);
                    nodequeue.push(node->left);
                    nodequeue.push(node->right);
                }
            }
            if(0 != layer.size()){
                result.push_back(layer);
            }
        }
        return result;
    }
    vector<vector<int> > Print(TreeNode* pRoot) {
        return level_print(pRoot);
    }
};