题目描述
blablabla
样例
blablabla
算法1
class Solution:
# 重建二叉树
def buildTree(self, pre, tin):
# write code here
if pre:
root = TreeNode(pre[0])
k = tin.index(pre[0])
root.left = self.buildTree(pre[1:k+1],tin[:k])
root.right = self.buildTree(pre[k+1:],tin[k+1:])
return root
else:
return None
# 进行广度优先遍历
def BFS(self,root):
if root is None:
return None
aqueue = []
aqueue.append(root)
k = []
while aqueue:
z = aqueue.pop(0)
k.append(z.val)
print(k)
if z.left != None:
aqueue.append(z.left)
if z.right != None:
aqueue.append(z.right)
return k