题解 | #按之字形顺序打印二叉树#
按之字形顺序打印二叉树
https://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0
function Print(pRoot)
{
let a=[]
// write code here
function level(root,a,l){
if (!root) return
else{
if(a[l]==undefined) a[l]=[]
if((l+2)%2==0){
a[l].push(root.val)
level(root.left,a,l+1)
level(root.right,a,l+1)
}else{
a[l].unshift(root.val)/
level(root.left,a,l+1)
level(root.right,a,l+1)
}
}
}
level(pRoot,a,0)
return a
}
{
let a=[]
// write code here
function level(root,a,l){
if (!root) return
else{
if(a[l]==undefined) a[l]=[]
if((l+2)%2==0){
a[l].push(root.val)
level(root.left,a,l+1)
level(root.right,a,l+1)
}else{
a[l].unshift(root.val)/
level(root.left,a,l+1)
level(root.right,a,l+1)
}
}
}
level(pRoot,a,0)
return a
}
