#199

Binary Tree Right Side View

pupil · 570 · lc medium +29 · 69.6% accepted · 13,364 likes · top 78%

⚑ Recursive DFS Traversal ⚑ BFS / Level-Order Traversal

Description

Given the root of a binary tree, return the values of the nodes visible when the tree is viewed from the right side, ordered from top to bottom.

Code

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def rightSideView(self, root: Optional[TreeNode]) -> List[int]:

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def rightSideView(self, root: Optional[TreeNode]) -> List[int]: