leetcode_c++:树: Binary Tree Level Order Traversal(102)

最新推荐文章于 2022-07-25 22:41:56 发布

LandscapeMi

最新推荐文章于 2022-07-25 22:41:56 发布

阅读量152

点赞数

分类专栏： leetcode(c++)

本文链接：https://blog.csdn.net/mijian1207mijian/article/details/52302624

版权

leetcode(c++) 专栏收录该内容

263 篇文章 0 订阅

订阅专栏

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

算法

BFS
O（N）

class Solution {
public:
    vector<vector<int> > levelOrder(TreeNode *root) {
        queue<TreeNode *> q;
        vector<vector<int> > res;
        vector<int> tmpv;
        TreeNode *front;

        if (root == NULL)
            return res;

        // bfs
        q.push(root);
        q.push(NULL);    // NULL is the seperator of levels
        while (!q.empty()) {
            front = q.front();
            q.pop();
            if (front) {
                tmpv.push_back(front->val);
                if (front->left)
                    q.push(front->left);
                if (front->right)
                    q.push(front->right);
            } else if (!tmpv.empty()) {
                res.push_back(tmpv);
                tmpv.clear();
                q.push(NULL);
            }
        }
        return res;
    }
};

算法

dfs
o（n）

class Solution {
private:
    vector<vector<int> >ans;
public:
    void DFS(TreeNode *curNode, int depth) {
        if (!curNode)
            return;
        // push back
        if (depth >= ans.size())
            ans.push_back(vector<int>(0));
        ans[depth].push_back(curNode->val);

        // recursive
        if (curNode->left)
            DFS(curNode->left, depth + 1);
        if (curNode->right)
            DFS(curNode->right, depth + 1);
    }

    vector<vector<int> > levelOrder(TreeNode *root) {
        ans.clear();
        DFS(root, 0);
        return ans;
    }
};