[Leetcode 199] Binary Tree Right Side View

https://leetcode.com/problems/binary-tree-right-side-view/description/

1) 코드

class Solution:
    def rightSideView(self, root: Optional[TreeNode]) -> List[int]:

        q = deque()
        answer = [] 

        if root == None:
            return answer 

        q.append(root)
            
        while q:
            tmp = [] 

            for i in range(len(q)):
                node = q.popleft() 
                tmp.append(node.val)
                if node.left != None:
                    q.append(node.left)
                if node.right != None:
                    q.append(node.right)
                    
            answer.append(tmp[-1])

        return answer 

2) 해설

• BFS를 통해서 접근하면 되는 문제이다.