leetcode--Binary Tree Right Side View
来源:互联网 发布:excel2010数据透视图 编辑:程序博客网 时间:2024/06/06 03:54
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
For example:
Given the following binary tree,
1 <--- / \2 3 <--- \ \ 5 4 <---
You should return [1, 3, 4]
.
题意:给定一颗二叉树,假设你站在二叉树的右边。从你的方向看出去,求你能见到的所有节点的值。
分类:二叉树
解法1:层次遍历。每次保留每层的最后一个节点就可以了。
解法2:层次遍历。和解法1思路一样,只是代码更加精简。
原文链接http://blog.csdn.net/crazy__chen/article/details/46574283
阅读全文
0 0
- [leetcode][tree] Binary Tree Right Side View
- LeetCode OJ Binary Tree Right Side View
- LeetCode:Binary Tree Right Side View
- [leetcode] 199 Binary Tree Right Side View
- [LeetCode]199.Binary Tree Right Side View
- Leetcode: Binary Tree Right Side View
- LeetCode | Binary Tree Right Side View
- [LeetCode] Binary Tree Right Side View
- LeetCode: Binary Tree Right Side View
- [leetcode]48 Binary Tree Right Side View
- [leetcode] Binary Tree Right Side View
- leetcode-199 Binary Tree Right Side View
- [LeetCode]Binary Tree Right Side View
- 199Binary Tree Right Side View-LeetCode
- Binary Tree Right Side View--LeetCode
- [LeetCode]Binary Tree Right Side View
- [LeetCode 199]Binary Tree Right Side View
- leetcode: Binary Tree Right Side View
- 深入理解String和StringBuilder
- 微信小程序开发(一)--数据存储
- LintCode 212 空格替换
- xgboost中自定义损失函数的使用方法
- 提升域功能级别
- leetcode--Binary Tree Right Side View
- 程序员必备:程序员额外创收秘籍!
- storm调优
- 如何使用CSDN-markdown编辑器
- 大数据分析你不能不懂的6个核心技术
- HDU 3068最长回文
- 蓝牙音响升压芯片,12V输出,FP6293
- Java基础之类之间的关系
- 康托 逆康托