Leetcode-binary Tree level Order traversal II

reverse the list of the last similar topic.

/** * Definition for Binary tree * public class TreeNode {* int val, * TreeNode left, * TreeNode right; TreeNode (int x) {val = x;} *} */public class Solution {public list<list<integer>> Levelorderbottom (Tre        Enode root) {list<list<integer>> List = new arraylist<> ();        list<list<integer>> trlist = new arraylist<> ();        BFS (0, Root, list);        for (int i=list.size ()-1; i>=0; i--) {Trlist.add (List.get (i));    } return trlist;        } public void BFs (int pos, TreeNode root, list<list<integer>> List) {if (root==null) return;        if (List.size () > pos) {list.get (POS). Add (Root.val);            } else {list<integer> L = new arraylist<> ();            L.add (Root.val);        List.add (l);        } BFS (pos+1, Root.left, list);    BFS (pos+1, root.right, list); }}

Leetcode-binary Tree level Order traversal II