#102 Binary Tree Level Order Traversal & #107 Binary Tree Level Order Traversal II

#102 Binary Tree Level Order Traversal

题目：

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree {3,9,20,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

题解：

/**
 * 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>> rs = new ArrayList<List<Integer>>();//注意这里的<span style="font-family: Arial, Helvetica, sans-serif;">new ArrayList<List<Integer>>()</span>，不是ArrayList，原因不知道
        if(root == null) return rs;
        ArrayList<TreeNode> preNode = new ArrayList<TreeNode>();
        ArrayList<Integer> pre = new ArrayList<Integer>();
        preNode.add(root);
        pre.add(root.val);
        while(!preNode.isEmpty()){
            rs.add(pre);
            ArrayList<TreeNode> curNode = new ArrayList<TreeNode>();
            ArrayList<Integer> cur = new ArrayList<Integer>();
            for (TreeNode treeNode : preNode){
                if(treeNode.left != null) {
                    curNode.add(treeNode.left);
                    cur.add(treeNode.left.val);
                }
                if(treeNode.right != null) {
                    curNode.add(treeNode.right);
                    cur.add(treeNode.right.val);
                }
            }
            preNode = new ArrayList<TreeNode>(curNode);
            pre = new ArrayList<Integer>(cur);
        }
        return rs;
    }
}

ps：很简单的思路，我第十次提交才通过，错误全是Compile Error，全部是！！养成良好的编写习惯！！！

#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,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its bottom-up level order traversal as:

[
  [15,7],
  [9,20],
  [3]
]

题解：

这个，加个翻转就ok了啊。

/**
 * 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>> rList = new ArrayList<List<Integer>>();
        List<List<Integer>> rs = new ArrayList<List<Integer>>();
        if(root == null) return rs;
        ArrayList<TreeNode> preNode = new ArrayList<TreeNode>();
        ArrayList<Integer> pre = new ArrayList<Integer>();
        preNode.add(root);
        pre.add(root.val);
        while(!preNode.isEmpty()){
            rs.add(pre);
            ArrayList<TreeNode> curNode = new ArrayList<TreeNode>();
            ArrayList<Integer> cur = new ArrayList<Integer>();
            for (TreeNode treeNode : preNode){
                if(treeNode.left != null) {
                    curNode.add(treeNode.left);
                    cur.add(treeNode.left.val);
                }
                if(treeNode.right != null) {
                    curNode.add(treeNode.right);
                    cur.add(treeNode.right.val);
                }
            }
            preNode = new ArrayList<TreeNode>(curNode);
            pre = new ArrayList<Integer>(cur);
        }
        //翻转
        for(int i=rs.size()-1;i>=0;i--){
            rList.add(rs.get(i));
        }
        return rList;
    }
}