package niuke.day1;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
public class Binary_tree_level_order_traversal_ii {
public static void main(String[] args) {
}
public ArrayList<ArrayList<Integer>> levelOrderBottom(TreeNode root) {
Queue<TreeNode> que = new LinkedList<TreeNode>();
ArrayList<ArrayList<Integer>> AL = new ArrayList<ArrayList<Integer>>();
Stack<ArrayList<Integer>> s = new Stack<>();
if(root == null)
return AL;
que.add(root);
while(que.size()>0) { //只要队列不为空,还有元素,就一直在循环
int size = que.size(); //利用size来把这一层数量记录,进行循环
ArrayList<Integer> al = new ArrayList<>();
for(int i = 0 ; i < size ; i ++) { //把这一层元素的下一层元素依次加入al中,并依次弹出本层元素加入到al中
if(que.peek().left != null) {
que.add(que.peek().left);
}
if(que.peek().right != null) {
que.add(que.peek().right);
}
al.add(que.peek().val);
que.remove();
}
s.push(al); //放入栈中
}
while(s.size()>0) {
AL.add(s.pop()); //这样就实现了倒序
}
return AL;
}
}
//一下是牛客网上的最佳解法
/*import java.util.*;
public class Solution {
public ArrayList<ArrayList<Integer>> levelOrderBottom(TreeNode root) {
ArrayList<ArrayList<Integer>> res = new ArrayList<>();
if(root == null) return res;
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
while ( ! queue.isEmpty()) {
ArrayList<Integer> list = new ArrayList<>();
int size = queue.size();
for (int i = 0; i < size; i ++ ) {
TreeNode temp = queue.poll();
list.add(temp.val);
if(temp.left != null) queue.add(temp.left);
if(temp.right != null) queue.add(temp.right);
}
res.add(0,list); //不利用栈进行倒序,而是直接加入到0位置,实现了倒叙
}
return res;
}
}*/