Bug Report for binary-tree-right-side-view

[siddhi47]

Bug Report for https://neetcode.io/problems/binary-tree-right-side-view

This code passes all tests.

from collections import deque
class Solution:
    def rightSideView(self, root: Optional[TreeNode]) -> List[int]:
        q = deque([root])
        res = []
        node_val = root.val if root else None
        if not node_val: return res
        while q:
            for _ in range(len(q)):
                node = q.popleft()
                if node:
                    node_val = node.val
                    q.extend([node.left, node.right])
            res.append(node_val)
        return res[:-1]

I think a new test case is needed. The code fails on this test case.
Test case:

Input = [0]