public class BinaryTreeLevelOrderTraversalII {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> ret =new ArrayList<>();
if(root==null)
{
return ret;
}
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root);
TreeNode curNode;
while (!queue.isEmpty())
{
int size=queue.size();
List<Integer> arrayList=new ArrayList<>();
for(int i=0;i<size;i++)
{
curNode=queue.poll();
arrayList.add(curNode.val);
if(curNode.left!=null)
{
queue.offer(curNode.left);
}
if(curNode.right!=null)
{
queue.offer(curNode.right);
}
}
ret.add(arrayList);
}
Collections.reverse(ret);
return ret;
}
}
利用层次遍历的思想