LeetCode 107. 二叉树的层次遍历 II（C++、python）

给定一个二叉树，返回其节点值自底向上的层次遍历。 （即按从叶子节点所在层到根节点所在的层，逐层从左向右遍历）

例如：
给定二叉树 [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

返回其自底向上的层次遍历为：

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

C++

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void func(vector<vector<int>>& res, TreeNode* root, int n)
    {
        if(NULL==root)
        {
            return;
        }
        else
        {
            if(0==n-res.size())
            {
                res.resize(n+1);
            }
            res[n].push_back(root->val);
            func(res, root->left, n+1);
            func(res, root->right, n+1);
        }
    }
    
    vector<vector<int>> levelOrderBottom(TreeNode* root) 
    {
        vector<vector<int>> res;
        func(res, root, 0);
        reverse(res.begin(),res.end());
        return res;
    }
};

python

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def func(self, res, root, n):
        if None==root:
            return res
        else:
            if n==len(res):
                res.append([])
            res[n].append(root.val)
            res=self.func(res, root.left, n+1)
            res=self.func(res, root.right, n+1)
            return res
    
    def levelOrderBottom(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        res=[]
        res=self.func(res, root, 0)
        return res[::-1]