LeetCode 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]
]

/**
 * 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) {
        if(root == null) return new LinkedList<>();
        Queue<TreeNode> queue = new LinkedList<>();
        add(root,queue);
        List<List<Integer>> total = new LinkedList<>();
        List<Integer> rootList = new LinkedList<>();
        rootList.add(root.val);
        total.add(0,rootList);
        while(!queue.isEmpty()){
                List<Integer> list = new LinkedList<>();
                Queue<TreeNode> tmp = queue;
                queue = new LinkedList<>();
                while(!tmp.isEmpty()){
                    TreeNode treeNode = tmp.poll();
                    list.add(treeNode.val);
                    add(treeNode,queue);
                }
                total.add(0,list);
        }
        return total;
    }
    public void add(TreeNode node,Queue<TreeNode> queue){
        if(node.left!=null)
            queue.offer(node.left);
        if(node.right!=null)
            queue.offer(node.right);
    }
}