106Construct Binary Tree from Inorder and Postorder Traversal
来源:互联网 发布:java获取当天0点时间 编辑:程序博客网 时间:2024/06/16 22:04
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def buildTree(self, inorder, postorder):
"""
:type inorder: List[int]
:type postorder: List[int]
:rtype: TreeNode
"""
if not inorder or not postorder:
return None
ind=inorder.index(postorder.pop())
root=TreeNode(inorder[ind])
root.right=self.buildTree(inorder[ind+1:],postorder)
root.left=self.buildTree(inorder[:ind],postorder)
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def buildTree(self, inorder, postorder):
"""
:type inorder: List[int]
:type postorder: List[int]
:rtype: TreeNode
"""
if not inorder or not postorder:
return None
ind=inorder.index(postorder.pop())
root=TreeNode(inorder[ind])
root.right=self.buildTree(inorder[ind+1:],postorder)
root.left=self.buildTree(inorder[:ind],postorder)
return root
给定中序和后序,先移除右再移除左
阅读全文
0 0
- LeetCode 106: Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode(106)Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode: Construct Binary Tree from Inorder and Postorder Traversal [106]
- LeetCode 106 Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode 106 Construct Binary Tree from Inorder and Postorder Traversal
- [leetcode 106] Construct Binary Tree from Inorder and Postorder Traversal
- [LeetCode 106]Construct Binary Tree from Inorder and Postorder Traversal
- leetcode || 106、Construct Binary Tree from Inorder and Postorder Traversal
- Construct Binary Tree from Inorder and Postorder Traversal - LeetCode 106
- LeetCode 106:Construct Binary Tree from Postorder and Inorder Traversal
- LeetCode---(106)Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode(106) Construct Binary Tree from Inorder and Postorder Traversal
- Leetcode #106 Construct Binary Tree from Inorder and Postorder Traversal
- leetcode 106: Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode 106: Construct Binary Tree from Inorder and Postorder Traversal
- 【LEETCODE】106-Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode 106 Construct Binary Tree from Inorder and Postorder Traversal
- 106Construct Binary Tree from Inorder and Postorder Traversal
- C++学习(15)
- ORACLE分区表、分区索引详解(转)
- Ext Js入门第6篇-动画处理
- cocos2d-x 坐标体系
- HTML5 新元素
- 106Construct Binary Tree from Inorder and Postorder Traversal
- 使用git将项目上传到github
- poj 1695 DP
- synchronized(内部锁)关键字——线程学习七
- 学习笔记2之继承
- hibernate原理和优点
- 使用本地广播
- 阿里云服务器配置可访问端口
- do{}while()和 while(){}的区别