Lintcode70 Binary Tree Level Order Traversal II solution 题解
2017-11-10 13:59
393 查看
【题目描述】
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
给出一棵二叉树,返回其节点值从底向上的层次序遍历(按从叶节点所在层到根节点所在的层遍历,然后逐层从左往右遍历)
【题目链接】
www.lintcode.com/en/problem/binary-tree-level-order-traversal-ii/
【题目解析】
这道题目是相对简单的,只需要计算出从上往下的按层遍历之后,将答案在层的维度上进行翻转即可。
对于答案的翻转,可以直接通过将第1个和最后1个交换,第2个和倒数第2个交换……来完成
【参考答案】
www.jiuzhang.com/solutions/binary-tree-level-order-traversal-ii/
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
给出一棵二叉树,返回其节点值从底向上的层次序遍历(按从叶节点所在层到根节点所在的层遍历,然后逐层从左往右遍历)
【题目链接】
www.lintcode.com/en/problem/binary-tree-level-order-traversal-ii/
【题目解析】
这道题目是相对简单的,只需要计算出从上往下的按层遍历之后,将答案在层的维度上进行翻转即可。
对于答案的翻转,可以直接通过将第1个和最后1个交换,第2个和倒数第2个交换……来完成
【参考答案】
www.jiuzhang.com/solutions/binary-tree-level-order-traversal-ii/
相关文章推荐
- Lintcode70 Binary Tree Level Order Traversal II solution 题解
- Binary Tree Level Order Traversal II java solution
- LeetCode Binary Tree Level Order Traversal II
- LeetCode -- Binary Tree Level Order Traversal II
- 107 Binary Tree Level Order Traversal II
- LeetCode-Binary Tree Level Order Traversal II
- [leetcode]Binary Tree Level Order Traversal II
- 【LeetCode】Binary Tree Level Order Traversal II
- 102/107. Binary Tree Level Order Traversal/II
- Leetcode 107 Binary Tree Level Order Traversal II
- [leetcode]Binary Tree Level Order Traversal II
- Balanced Binary Tree,Binary Tree Level Order Traversal I&II,Maximum Depth of Binary Tree,Plus One
- leetcode:Binary Tree Level Order Traversal II
- Leetcode:Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal II
- leetcode - Binary Tree Level Order Traversal i ii
- Binary Tree Level Order Traversal II -- leetcode
- [LeetCode 107]Binary Tree Level Order Traversal II(递归法)
- leetcode-107-Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal II问题及解法