LintCode / LeetCode 102. Binary Tree Level Order Traversal | Queue or Stack DFS | C++ Python

解法一 queue

Python

class Solution:
    def levelOrder(self, root: TreeNode) -> List[List[int]]:
        if not root: return []
        stack = [root]
        res = []
        while stack:
            size = len(stack)
            tmp = []
            for i in range(size):
                top = stack.pop(0)
                tmp.append(top.val)
                if top.left:
                    stack.append(top.left)
                if top.right:
                    stack.append(top.right)
            res.append(tmp)
        return res

C++

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode * root) {
        queue<TreeNode*> q;
        vector<vector<int>> res;
        if(!root) return res;
        q.push(root);
        while(!q.empty()){
            int n = q.size();
            vector<int> temp;
            for(int i=0;i<n;i++){
                TreeNode* node = q.front(); q.pop();
                temp.push_back(node->val);
                if(node->left) q.push(node->left);
                if(node->right) q.push(node->right);
            }
            res.push_back(temp);
        }
        return res;
    }
};

解法二 DFS

class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode * root) {
        vector<vector<int>> res;
        helper(root, 0, res);
        return res;
    }
    void helper(TreeNode* root, int level, vector<vector<int>>& res){
        if(!root) return;
        if(res.size()<=level){
            res.push_back(vector<int>{root->val});
        }else{
            res[level].push_back(root->val);
        }
        helper(root->left, level+1, res);
        helper(root->right, level+1, res);
    }
};