⼆叉树的右视图
解法:队列
力扣102.⼆叉树的层序遍历:https://blog.csdn.net/weixin_45047081/article/details/115797910?spm=1001.2014.3001.5501
力扣107.⼆叉树的层次遍历II:https://blog.csdn.net/weixin_45047081/article/details/115798522?spm=1001.2014.3001.5501
通过观察发现,其做法还是广度优先搜索,并且和之前的102.⼆叉树的层序遍历 几乎一致。右视图即为每一层的最右节点,因此,我们还是采用跟之前一样的方法,获取每一层的节点,然后通过循环遍历及索引的操作,获取每一层的最右节点
代码如下:
class Solution:
def rightSideView(self, root: TreeNode) -> List[int]:
if not root:
return []
stack=[root]
rtn=[]
while stack:
faker=[]
size=len(stack)
for _ in range(size):
now=stack.pop(0)
faker.append(now.val)
if now.left:
stack.append(now.left)
if now.right:
stack.append(now.right)
rtn.append(faker)
rtn=[x[-1] for x in rtn]
return rtn