【树-中等】剑指 Offer II 046. 二叉树的右侧视图

【题目】

【代码】

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:    
    def rightSideView(self, root: TreeNode) -> List[int]:
        if not root:
            return []
        queue=[root]
        ans=[]
        while queue:
            sz=len(queue)
            for i in range(sz):
                root=queue.pop(0)
                if i==0:
                    ans.append(root.val)
                if root.right:
                    queue.append(root.right)
                if root.left:
                    queue.append(root.left)
        return ans

【方法2】

class Solution:
    def dfs(self,root,dep):
        if not root:
            return 
        if dep>len(self.ans):
            self.ans.append(root.val)
        self.dfs(root.right,dep+1)
        self.dfs(root.left,dep+1)

    def rightSideView(self, root: TreeNode) -> List[int]:
        self.ans=[]
        self.dfs(root,1)
        return self.ans