Algobase
Problems
Get Premium
Pricing
Problems
/
223. Binary Tree Right Side View
Prev
Next
Visualizer
Problem
Solution
Code
Balanced Tree
Left-Heavy Tree
Right-Heavy Tree
⌥
Visualizer will appear here
Problem
Solution
Code
1
def right_side_view(root):
2
result = []
3
4
def dfs(node, depth):
5
if not node:
6
return
7
if depth == len(result):
8
result.append(node.val)
9
dfs(node.right, depth + 1)
10
dfs(node.left, depth + 1)
11
12
dfs(root, 0)
13
return result
Visualizer
Balanced Tree
Left-Heavy Tree
Right-Heavy Tree
⌥
Visualizer will appear here