199-Binary-Tree-Right-Side-View
Sat 17 May 2025
https://leetcode.com/problems/binary-tree-right-side-view
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def rightSideView(self, root: Optional[TreeNode]) -> List[int]:
if not root:
return []
ans = []
q = deque([root])
while q:
size = len(q)
for i in range(size):
root = q.popleft()
if i == size - 1:
ans.append(root.val)
if root.left:
q.append(root.left)
if root.right:
q.append(root.right)
return ans
new Solution().rightSideView()
Score: 5
Category: leetcode