剑指offer——60.把二叉树打印成多行

题目描述

代码

function Print(pRoot)
{
// write code here
var queue = [];//存储节点队列
var result = [];
if(pRoot==null) return result;
var nextLevel = 0;
queue.push(pRoot);
var toBePrinted = 1;//每一行节点个数
var arr = [];
while(queue.length){
var temp = queue.shift();
toBePrinted--;
arr.push(temp.val);
if(temp.left){
queue.push(temp.left);
nextLevel++;
}
if(temp.right){
queue.push(temp.right);
nextLevel++;
}
if(toBePrinted==0){
toBePrinted=nextLevel;
nextLevel=0;
result.push(arr);
arr = [];
}
}
return result;

}