1、二叉树前序、中序,构建完整二叉树并后序遍历输出 #!/usr/bin/env python # -*- coding: utf-8 -*- class TreeNode: def __init__(self, val): self.val = val self.right = None self.left = None class Solution: def rebuildTree(self, preorder, inorder): adict = {} for i in range(len(...