JZ60 把二叉树打印成多行

本文最后更新于：2022年4月9日 中午

image-20211010153915185

Solution

  • 层序遍历
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/*
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> > Print(TreeNode* pRoot) {
        vector<vector<int>> res;
        if (pRoot == nullptr) return res;
        TreeNode* cur = pRoot;
        queue<TreeNode *> que;
        que.push(cur);
        while (!que.empty()) {
            int n = que.size();
            vector<int> level;
            for (int i = 0; i < n; ++i) {
                cur = que.front();
                que.pop();
                level.push_back(cur->val);
                if (cur->left) que.push(cur->left);
                if (cur->right) que.push(cur->right);
            }
            res.push_back(level);
        }
        return res;
    }
};