Project Notes

Binary Tree Right Side View

3 min read

Nav: << previous: 198.打家劫舍 | next: 200.岛屿数量 >>

Description

tab: English
 
<p>Given the <code>root</code> of a binary tree, imagine yourself standing on the <strong>right side</strong> of it, return <em>the values of the nodes you can see ordered from top to bottom</em>.</p>
 
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
 
<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">root = [1,2,3,null,5,null,4]</span></p>
 
<p><strong>Output:</strong> <span class="example-io">[1,3,4]</span></p>
 
<p><strong>Explanation:</strong></p>
 
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/11/24/tmpd5jn43fs-1.png" style="width: 400px; height: 207px;" /></p>
</div>
 
<p><strong class="example">Example 2:</strong></p>
 
<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">root = [1,2,3,4,null,null,null,5]</span></p>
 
<p><strong>Output:</strong> <span class="example-io">[1,3,4,5]</span></p>
 
<p><strong>Explanation:</strong></p>
 
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/11/24/tmpkpe40xeh-1.png" style="width: 400px; height: 214px;" /></p>
</div>
 
<p><strong class="example">Example 3:</strong></p>
 
<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">root = [1,null,3]</span></p>
 
<p><strong>Output:</strong> <span class="example-io">[1,3]</span></p>
</div>
 
<p><strong class="example">Example 4:</strong></p>
 
<div class="example-block">
<p><strong>Input:</strong> <span class="example-io">root = []</span></p>
 
<p><strong>Output:</strong> <span class="example-io">[]</span></p>
</div>
 
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>
 
<ul>
	<li>The number of nodes in the tree is in the range <code>[0, 100]</code>.</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
</ul>
 
 
 
---
 
[submissions](https://leetcode.com/problems/binary-tree-right-side-view/submissions/) | [solutions](https://leetcode.com/problems/binary-tree-right-side-view/solutions/)
 
 
tab: 中文
 
<p>给定一个二叉树的 <strong>根节点</strong> <code>root</code>，想象自己站在它的右侧，按照从顶部到底部的顺序，返回从右侧所能看到的节点值。</p>
 
<p>&nbsp;</p>
 
<p><strong class="example">示例 1：</strong></p>
 
<div class="example-block">
<p><span class="example-io"><b>输入：</b>root = [1,2,3,null,5,null,4]</span></p>
 
<p><strong>输出：</strong><span class="example-io">[1,3,4]</span></p>
 
<p><strong>解释：</strong></p>
 
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/11/24/tmpd5jn43fs-1.png" style="width: 400px; height: 207px;" /></p>
</div>
 
<p><strong class="example">示例 2：</strong></p>
 
<div class="example-block">
<p><span class="example-io"><b>输入：</b>root = [1,2,3,4,null,null,null,5]</span></p>
 
<p><span class="example-io"><b>输出：</b>[1,3,4,5]</span></p>
 
<p><strong>解释：</strong></p>
 
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/11/24/tmpkpe40xeh-1.png" style="width: 400px; height: 214px;" /></p>
</div>
 
<p><strong class="example">示例 3：</strong></p>
 
<div class="example-block">
<p><strong>输入：</strong><span class="example-io">root = [1,null,3]</span></p>
 
<p><strong>输出：</strong><span class="example-io">[1,3]</span></p>
</div>
 
<p><strong class="example">示例 4：</strong></p>
 
<div class="example-block">
<p><span class="example-io"><b>输入：</b>root = []</span></p>
 
<p><strong>输出：</strong><span class="example-io">[]</span></p>
 
<p>&nbsp;</p>
</div>
 
<p><strong>提示:</strong></p>
 
<ul>
	<li>二叉树的节点个数的范围是 <code>[0,100]</code></li>
	<li><meta charset="UTF-8" /><code>-100&nbsp;&lt;= Node.val &lt;= 100</code>&nbsp;</li>
</ul>
 
 
 
---
 
[提交记录](https://leetcode.cn/problems/binary-tree-right-side-view/submissions/) | [题解](https://leetcode.cn/problems/binary-tree-right-side-view/solution/)

Solutions & Notes

properties:
  note.updated:
    displayName: Last Updated
  note.relative_links:
    displayName: Related Links
  note.desc:
    displayName: Description
  note.grade:
    displayName: Rating
  note.program_language:
    displayName: Language
  note.time_complexity:
    displayName: TC
  note.space_complexity:
    displayName: SC
views:
  - type: table
    name: Solutions & Notes
    filters:
      and:
        - file.hasLink(this.file)
        - file.tags.containsAny("leetcode/solution", "leetcode/note")
    order:
      - file.name
      - desc
      - program_language
      - time_complexity
      - space_complexity
      - grade
      - relative_links
      - updated
    sort:
      - property: grade
        direction: ASC
      - property: time_complexity
        direction: ASC
      - property: program_language
        direction: ASC
    columnSize:
      file.name: 104
      note.space_complexity: 65
      note.grade: 126

Similar Problems

properties:
  note.lcTopics:
    displayName: Topics
  note.lcAcRate:
    displayName: AC Rate
  note.favorites:
    displayName: Favorites
  note.grade:
    displayName: Rating
  note.translatedTitle:
    displayName: Title (CN)
  note.lcDifficulty:
    displayName: Difficulty
views:
  - type: table
    name: Similar Problems
    filters:
      and:
        - file.hasLink(this.file)
        - similarQuestions.contains(this.file)
    order:
      - file.name
      - translatedTitle
      - lcTopics
      - lcDifficulty
      - lcAcRate
      - grade
      - favorites
    sort:
      - property: file.name
        direction: ASC
      - property: lcTopics
        direction: DESC
    columnSize:
      note.translatedTitle: 240
      note.lcTopics: 347
      note.lcAcRate: 75
      note.grade: 122

Graph View

Backlinks