二叉树层序遍历_整理二叉树层序遍历的题目

思路：层序遍历，每一层最右边的数字也就是右视图看到的。

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def rightSideView(self, root: TreeNode) -> List[int]:
        if not root:
            return []
        
        queue = [root]
        res = []
        while queue:
            cur_len = len(queue)
            res.append(queue[-1].val)
            #遍历当前层里面的节点
            for i in range(cur_len):
                cur = queue.pop(0)
                if cur.left:
                    queue.append(cur.left)
                if cur.right:
                    queue.append(cur.right)
        return res

更新中...