107. Binary Tree Level Order Traversal II

107. Binary Tree Level Order Traversal II
     Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree [3,9,20,null,null,15,7],
3
/
9 20
/
15 7
return its bottom-up level order traversal as:
[
[15,7],
[9,20],
[3]
]
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 levelOrderBottom(self, root: TreeNode) -> List[List[int]]:
        res = []
        self.dfs(root,0,res)
        return res
    def dfs(self,root,level,res):
        if root:
            if len(res)<level+1:
                res.insert(0,[])
            res[-(level+1)].append(root.val)
            self.dfs(root.left,level+1,res)
            self.dfs(root.right,level+1,res)
            

java:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
        LinkedList<List<Integer>> res =  new LinkedList<List<Integer>>();
        dfs(root,0,res);
        return res;
    }
    private void dfs(TreeNode root,int level,LinkedList<List<Integer>>res){
        if(root == null)
            return;
        if(res.size()-1<level)
             res.addFirst(new LinkedList<Integer>());
        res.get(res.size()-1-level).add(root.val);
        dfs(root.left,level+1,res);
        dfs(root.right,level+1,res);
    }
}