Package g0101_0200.s0199_binary_tree_right_side_view

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    199 - Binary Tree Right Side View\.

    Medium

    Given the root of 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.

    Example 1:

    Input: root = 1,2,3,null,5,null,4

    Output: 1,3,4

    Example 2:

    Input: root = 1,null,3

    Output: 1,3

    Example 3:

    Input: root = []

    Output: []

    Constraints:

    • The number of nodes in the tree is in the range [0, 100].

    • -100 <= Node.val <= 100

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final List<Integer> rightSideView(TreeNode root)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait