Binary Tree Zigzag Level Order Traversal

来源:互联网 发布:如何制作淘宝店招图片 编辑:程序博客网 时间:2024/06/06 08:38

Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right,
then right to left for the next level and alternate between).
For example: Given binary tree 3,9,20,#,#,15,7,
3
/ \
9 20
/ \
15 7
return its zigzag level order traversal as:
[
[3],
[20,9],
[15,7]
]
题意:
层序遍历的变形。螺旋遍历

0 0
原创粉丝点击