[Leetcode]105. Construct Binary Tree from Preorder and Inorder Traversal@python
来源:互联网 发布:淘宝账户管理在哪里找 编辑:程序博客网 时间:2024/06/05 20:44
题目
Given preorder and inorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
题目要求
给定对一个binary-tree的前序遍历和中序遍历。重建二叉树。
解题思路
前序遍历的第一个值为根节点的值,在中序遍历中找到这个值的位置,中序遍历中这个值左边的值为左子树的值,右边的值为右子树的值。
代码
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): def buildTree(self, preorder, inorder): """ :type preorder: List[int] :type inorder: List[int] :rtype: TreeNode """ if len(preorder) == 0 or len(inorder) == 0: return None root = TreeNode(preorder[0]) in_pos = inorder.index(root.val) preorder.pop(0) root.left = self.buildTree(preorder,inorder[:in_pos]) root.right = self.buildTree(preorder,inorder[in_pos + 1:]) return root
0 0
- LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal
- [Leetcode] 105. Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode --- 105. Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode]*105.Construct Binary Tree from Preorder and Inorder Traversal
- [leetcode] 105.Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal LeetCode
- LeetCode#105. Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode *** 105. Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal
- 【leetcode】105. Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode-105.Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode - 105. Construct Binary Tree from Preorder and Inorder Traversal
- [Leetcode]105. Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode] 105. Construct Binary Tree from Preorder and Inorder Traversal
- [leetcode] 105. Construct Binary Tree from Preorder and Inorder Traversal
- [leetcode]105. Construct Binary Tree from Preorder and Inorder Traversal
- 我的2015年度总结
- python脚本检查网页能否打开
- Android之广播二(静态注册实现开机启动)
- Codeforces 617D Polyline 【枚举】
- 信号量与锁的差别
- [Leetcode]105. Construct Binary Tree from Preorder and Inorder Traversal@python
- 用 Python 和 OpenCV 检测和跟踪运动对象
- LeetCode264. Ugly Number II
- linux用户管理笔记
- QLPreviewItem
- C++ list 使用方法
- IOS高级控件(一)
- centos6.5修改硬盘分区
- 安卓蓝牙入门二-------整合版本