# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def rightSideView(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
if not root:
return []
ans = []
queue = [root]
while queue:
for i in range(len(queue)):
cur = queue.pop(0)
if i == 0:
ans.append(cur.val)
if cur.right:
queue.append(cur.right)
if cur.left:
queue.append(cur.left)
return ans
近期评论