leetcode--Binary Tree Zigzag Level Order Traversal
来源:互联网 发布:樱井知香怎么喷那么多 编辑:程序博客网 时间:2024/06/07 09:23
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]]
题意:给定二叉树,遍历每一层。对于当前层,如果从左到右,则下一层从右到左。
分类:二叉树
解法1:层次遍历。使用一个标记来标记层的结束。每次结束将队列里面的数据保存。
解法2:层次遍历。使用LinkedList从而可以在头部添加节点。
使用level来做标记从而省去层次标记。
原文链接http://blog.csdn.net/crazy__chen/article/details/46484543
阅读全文
0 0
- LeetCode: Binary Tree Zigzag Level Order Traversal
- [LeetCode]Binary Tree Zigzag Level Order Traversal
- LeetCode Binary Tree Zigzag Level Order Traversal
- [Leetcode] Binary Tree Zigzag Level Order Traversal
- Leetcode: Binary Tree Zigzag Level Order Traversal
- LeetCode Binary Tree Zigzag Level Order Traversal
- [LeetCode] Binary Tree Zigzag Level Order Traversal
- [Leetcode] Binary Tree Zigzag Level Order Traversal
- 【leetcode】Binary Tree Zigzag Level Order Traversal
- [LeetCode]Binary Tree Zigzag Level Order Traversal
- [Leetcode]Binary Tree Zigzag Level Order Traversal
- [leetcode]Binary Tree Zigzag Level Order Traversal
- Leetcode: Binary Tree Zigzag Level Order Traversal
- LeetCode-Binary Tree Zigzag Level Order Traversal
- [leetcode] Binary Tree Zigzag Level Order Traversal
- LeetCode - Binary Tree Zigzag Level Order Traversal
- LeetCode:Binary Tree Zigzag Level Order Traversal
- [LeetCode] Binary Tree Zigzag Level Order Traversal
- 读取win或linux绝对路径下的属性文件
- 【Linux】Linux中常用操作命令
- iOS开发
- Linux使用Wine安装腾讯TIM
- java IO流面试总结
- leetcode--Binary Tree Zigzag Level Order Traversal
- Android中关于键盘管理,点击除editText外的区域收起键盘
- java 中的Scanner(非常详细不看后悔)
- [一天一项目]象棋
- 集成电路中测试概述(三)
- MongoDB如何添加用户?使其有效?
- popupwindow 上点击 spinner报错
- linux 下安装jdk
- Kafka入门及使用(一)- kafka架构介绍