Leetcode:199. 二叉树的右视图 - 力扣(LeetCode) (leetcode-cn.com)
属于BFS的一个应用场景:层序遍历
时间复杂度:O(n)
空间复杂度:O(n)
这里用到了双端队列,方便查找右视图
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution(object):
def rightSideView(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
deque,visited=[],[]
if root:
deque.append(root)
while deque:
tmp=[]
visited.append(deque[-1].val)
while deque:
node=deque.pop(0)
if node.left:
tmp.append(node.left)
if node.right:
tmp.append(node.right)
deque=tmp
return visited