题目描述:
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,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
return its zigzag level order traversal as:
[ [3], [20,9], [15,7] ]
中文理解:
给定一个二叉树,Z字形打印逐层打印这棵树。
解题思路:
首先递归逐层保存一个变量表示层数-1,然后将相同层的节点值保存在一个序列中,最后合并到一起统一保存,得到逐层遍历的结果之后,在偶数层的位置反转,即可得到最终的结果。
代码(java):
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
List<List<Integer>> list=new ArrayList();
if(root==null)return list;
zigzagLevelOrderHelper(list,root,0);
for(int i=0;i<list.size();i++){
if(i%2==1)Collections.reverse(list.get(i));
}
return list;
}
public void zigzagLevelOrderHelper(List<List<Integer>> list,TreeNode root,int level){
if(root==null)return;
if(level>=list.size()){
List<Integer> temp=new ArrayList();
temp.add(root.val);
list.add(new ArrayList(temp));
}
else{
List<Integer> temp=list.get(level);
temp.add(root.val);
}
zigzagLevelOrderHelper(list,root.left,level+1);
zigzagLevelOrderHelper(list,root.right,level+1);
}
}