Leetcode之七Binary Tree Level Order Traversal II

最新推荐文章于 2018-04-25 10:20:41 发布

urgemule

最新推荐文章于 2018-04-25 10:20:41 发布

阅读量375

点赞数

分类专栏： java 文章标签： leetcode traversal

本文链接：https://blog.csdn.net/u011559205/article/details/38025251

版权

java 专栏收录该内容

42 篇文章 0 订阅

订阅专栏

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

return its bottom-up level order traversal as:

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

The above binary tree is serialized as "{1,2,3,#,#,4,#,#,5}".

/**
 * 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(TreeNode root) {
		ArrayList<List<Integer>> AList = new ArrayList<List<Integer>>();
		recur(root, 0, AList);
		
		List<Integer> tmp = null;
		int len = AList.size();
		for(int i=0;i < len / 2;i++){
			tmp = AList.get(i);
			AList.set(i, AList.get(len - 1 - i));
			AList.set(len - 1 - i, tmp);
		}
	return AList;
    }
	private void recur(TreeNode tNode, int depth, ArrayList<List<Integer>> AList){
		ArrayList<Integer> list = null;
		if(tNode != null){
			if(AList.size() > depth){//means list depth has ex
				list = (ArrayList<Integer>)(AList.get(depth));
			}else{
				list = new ArrayList<Integer>();
				AList.add(list);
			}
//			System.out.println(tNode.val);//
			list.add(tNode.val);
			
			recur(tNode.left, depth + 1, AList);
			recur(tNode.right, depth + 1, AList);
		}
	}
}

结果倒序即可