python:剑指 Offer 07. 重建二叉树 根据前序遍历和中序遍历 输出根节点 示例 输入: Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7] Output: [3,9,20,null,null,15,7] Input: preorder = [-1], inorder = [-1] Output: [-1]