LeetCode Binary Tree Right Side View

原创 2015年07月08日 21:31:56

Description:

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].

Solution:

每一层从右到左的BFS,然后把最右的记录下来即可。

import java.util.*;

public class Solution {
	public List<Integer> rightSideView(TreeNode root) {
		List<Integer> list = new ArrayList<Integer>();
		LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
		LinkedList<Integer> layer = new LinkedList<Integer>();

		queue.add(root);
		layer.add(0);

		TreeNode node;
		int l, preLayer = -1;
		while (!queue.isEmpty()) {
			node = queue.pop();
			l = layer.pop();
			if (node == null)
				continue;

			if (l != preLayer) {
				preLayer = l;
				list.add(node.val);
			}

			if (node.right != null) {
				queue.add(node.right);
				layer.add(l + 1);
			}
			if (node.left != null) {
				queue.add(node.left);
				layer.add(l + 1);
			}
		}

		return list;
	}
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

leetcode 199. Binary Tree Right Side View-树的右视图|递归|非递归|Java|Python

原题链接:199. Binary Tree Right Side View 【思路】非递归实现 层次遍历,每一层都是从左到右遍历,将每一层的最右一个节点添加到结果集中就是我们需要得到的结果: publ...

LeetCode: Binary Tree Right Side View

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nod...

LeetCode #199 - Binary Tree Right Side View

题目描述: Given a binary tree, imagine yourself standing on the right side of it, return the values of ...

Leetcode: Binary Tree Right Side View

题目: Given a binary tree, imagine yourself standing on the right side of it, return the values of...

LeetCode Binary Tree Right Side View

题目: Given a binary tree, imagine yourself standing on the right side of it, return the values o...

LeetCode-199. Binary Tree Right Side View (JAVA)(二叉树最右侧结点)

LeetCode-199. Binary Tree Right Side View (JAVA)(二叉树最右侧结点)

Leetcode 199 Binary Tree Right Side View 二叉树右视图

给出一个二叉树,设想你从树的右侧看过来,返回你从上往下可以看到的结点.

LeetCode题解-199-Binary Tree Right Side View

原题 原题链接:https://leetcode.com/problems/binary-tree-right-side-view/ 解法概览 解法1:迭代法,BFS 解法2:...

LeetCode 199. Binary Tree Right Side View

题目:给定一棵二叉树,每个节点的信息包括左右节点的指针,以及其本身的值。让你给出二叉树的“右视图”, 即从上至下给出每一层最右边的节点。           这题可以用宽度优先搜索的方法来做,具体实...

[LeetCode]Binary Tree Right Side View

QuestionGiven a binary tree, imagine yourself standing on the right side of it, return the values of...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)