[LeetCode 199] Binary Tree Right Side View

最新推荐文章于 2025-11-24 01:23:29 发布

原创最新推荐文章于 2025-11-24 01:23:29 发布 · 467 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #Tree #DFS

Leetcode 同时被 2 个专栏收录

287 篇文章

订阅专栏

Java

106 篇文章

订阅专栏

本文介绍了一种解决二叉树右视图问题的算法实现，通过队列进行层级迭代，每次迭代保留当前层级最右侧节点的值，最终得到从顶部到底部的右视图节点值。

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:

1. use queue to do level iteration.

public List<Integer> rightSideView(TreeNode root) {
        List<Integer> result = new LinkedList<>();
        if(root == null) return result;
        Queue<TreeNode> levelNodes = new LinkedList<>();
        levelNodes.offer(root);
        while(levelNodes.size()>0){
            TreeNode n2 = levelNodes.peek();
            int len = levelNodes.size();
            for(int i=0;i<len;i++){
                TreeNode n1 = levelNodes.poll();
                if(n1.right!=null)
                    levelNodes.offer(n1.right);
                if(n1.left!=null)
                    levelNodes.offer(n1.left);
                
            }
            result.add(n2.val);
        }
        return result;
    }