#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
# 求二叉树的右视图
# @param xianxu int整型一维数组 先序遍历
# @param zhongxu int整型一维数组 中序遍历
# @return int整型一维数组
#
class Solution:
def solve(self , xianxu , zhongxu ):
# write code here
root = self.reConstructBinaryTree(xianxu, zhongxu)
return self.rightSideView(root)
def reConstructBinaryTree(self, pre, tin):#pre、tin分别是前序序列和中序序列
# write code here
if len(pre)>0:
root=TreeNode(pre[0])#前序序列的第一个肯定是当前子树的根节点
rootid=tin.index(root.val)#通过根节点在中序序列中的位置划分出左右子树包含的节点
root.left=self.reConstructBinaryTree(pre[1:1+rootid],tin[:rootid])#重建左子树
root.right=self.reConstructBinaryTree(pre[1+rootid:],tin[rootid+1:])#重建右子树
return root
def rightSideView(self, root):
q = []
res = []
if root is None:
return res
q.append(root)
while q:
size = len(q)
while size:
if size == 1:
res.append(q[0].val)
if q[0].left:
q.append(q[0].left)
if q[0].right:
q.append(q[0].right)
q.pop(0)
size = size - 1
return res
# 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]:
q = []
res = []
if root is None:
return res
q.append(root)
while q:
size = len(q)
while size:
if size == 1:
res.append(q[0].val)
if q[0].left:
q.append(q[0].left)
if q[0].right:
q.append(q[0].right)
q.pop(0)
size = size - 1
return res