102Binary Tree Level Order Traversal (java)

层次遍历，这两题，一题是从root到leaf，二题是从leaf到root，用list.add(position,value);就行。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
 //好高兴，又是一题，啧啧
public class Solution {
   public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> answerList = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<TreeNode>();
TreeNode nextLevelNode=null;
if(root == null) return answerList;
queue.add(root);
 
while(!queue.isEmpty()){
List<Integer> temp = new ArrayList<Integer>();
nextLevelNode =null;
while(nextLevelNode != queue.peek()&&queue.isEmpty() == false){
TreeNode currentNode = queue.remove();
if(nextLevelNode == null){
if(currentNode.left != null) nextLevelNode = currentNode.left;
else if(currentNode.right != null) nextLevelNode = currentNode.right;
 
}
temp.add(currentNode.val);
if(currentNode.left !=null) queue.add(currentNode.left);
if(currentNode.right !=null) queue.add(currentNode.right);
}
answerList.add(temp);
}
return answerList;
   }
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    
        public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> answerList = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<TreeNode>();
TreeNode nextLevelNode=null;
if(root == null) return answerList;
queue.add(root);
 
while(!queue.isEmpty()){
List<Integer> temp = new ArrayList<Integer>();
nextLevelNode =null;
while(nextLevelNode != queue.peek()&&queue.isEmpty() == false){
TreeNode currentNode = queue.remove();
if(nextLevelNode == null){
if(currentNode.left != null) nextLevelNode = currentNode.left;
else if(currentNode.right != null) nextLevelNode = currentNode.right;
 
}
temp.add(currentNode.val);
if(currentNode.left !=null) queue.add(currentNode.left);
if(currentNode.right !=null) queue.add(currentNode.right);
}
answerList.add(0,temp);
}
return answerList;
   }
    
}