leetCode No.199 Binary Tree Right Side View
来源:互联网 发布:二进制数组转字符串 编辑:程序博客网 时间:2024/06/04 19:45
题目
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]
.
标签:Tree、Depth-first Search、Breadth-first Search
相似题目: (M) Populating Next Right Pointers in Each Node
题意
给定一棵二叉树,假设一个人站在这棵树的右侧,同一高度的节点,如果某一节点的右侧有兄弟节点的话,那么这一节点是不可见的。
解题思路
采用广搜的思路,每一次从左至右的将每一个队列中的节点出队,最后一个出队的即为这一层最右侧的点。在出队的同时,将当前出队的点的子节点按照从左至右的顺序入队。
重复这个过程直到队列为空。
代码
public class Solution { public List<Integer> rightSideView(TreeNode root) { List<Integer> res = new ArrayList<>(); if (root == null) { return res; } Queue<TreeNode> queue = new LinkedList<TreeNode>(); queue.offer(root); while (! queue.isEmpty()) { int size = queue.size(); while (size -- > 0) { TreeNode node = queue.poll(); if (size == 0) { res.add(node.val); } if (node.left != null) { queue.offer(node.left); } if (node.right != null) { queue.offer(node.right); } } } return res; }}
相关链接
原题
所有题解链接(github)
0 0
- Leetcode NO.199 Binary Tree Right Side View
- leetCode No.199 Binary Tree Right Side View
- LeetCode No.199 Binary Tree Right Side View
- [leetcode] 199 Binary Tree Right Side View
- leetcode-199 Binary Tree Right Side View
- 199Binary Tree Right Side View-LeetCode
- [LeetCode 199]Binary Tree Right Side View
- Leetcode 199: Binary Tree Right Side View
- LeetCode 199-Binary Tree Right Side View
- Binary Tree Right Side View - LeetCode 199
- leetcode[199]:Binary Tree Right Side View
- 【Leetcode】Binary Tree Right Side View #199
- LeetCode(199)Binary Tree Right Side View
- [LeetCode 199] Binary Tree Right Side View
- leetcode 199: Binary Tree Right Side View
- 【LEETCODE】199-Binary Tree Right Side View
- Leetcode #199 Binary Tree Right Side View
- LeetCode 199 Binary Tree Right Side View
- ORA-23421
- 利用socket上传文件
- java excel导出并下载
- 文件读写函数汇总
- 使用Maven搭建Struts2项目
- leetCode No.199 Binary Tree Right Side View
- Android 编程技巧之 ----- 解决国内 GPS 定位难的问题
- 洛谷 P1027 CODE[VS] 1041 [NOIP2001 T4] Car的旅行路线
- Mysql开发技巧之Join从句
- 如何编辑pdf 删除pdf中不要的页面
- linux 下安装redis
- bzoj usaco 1231
- Qt入门读后总结1,参考C++ GUI QT4
- sqlserver查看阻塞程序