LeetCode题解:Construct Binary Tree from Inorder and Postorder Traversal
来源:互联网 发布:日本充气娃娃淘宝网 编辑:程序博客网 时间:2024/05/19 22:59
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
题解:通过中序遍历和后序遍历还原二叉树
解决思路:首先要明确一点,对于后序遍历的结果,如果一个元素所在的位置为i,若在中序遍历的i-1位置的元素为该元素的根结点,说明该元素就是所在子树的右儿子(且没有子树),否则存在右子树。左子树倒没什么特别的
代码:
public class Solution { private int inLen; private int postLen; public TreeNode buildTree(int[] inorder, int[] postorder) { inLen = inorder.length; postLen = postorder.length; return buildTree(inorder, postorder, null); } private TreeNode buildTree(int[] inorder, int[] postorder, TreeNode root){ if(postLen < 0){ return null; } TreeNode node = new TreeNode(postorder[postLen--]); if(inorder[postLen] != node.val){ node.right = buildTree(inorder, postorder, node); } inLen--; if((root == null) || inorder[inLen] != root.val){ node.left = buildTree(inorder, postorder, node); } return node; }}
0 0
- LeetCode题解: Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode题解:Construct Binary Tree from Inorder and Postorder Traversal
- *(leetcode) Construct Binary Tree from Inorder and Postorder Traversal (tree)
- LeetCode[Tree]: Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode: Construct Binary Tree from Inorder and Postorder Traversal
- [LeetCode]Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode: Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode: Construct Binary Tree from Inorder and Postorder Traversal
- [LeetCode] Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode Construct Binary Tree from Inorder and Postorder Traversal
- [Leetcode] Construct Binary Tree from Inorder and Postorder Traversal
- leetcode 110: Construct Binary Tree from Inorder and Postorder Traversal
- 【leetcode】Construct Binary Tree from Inorder and Postorder Traversal
- [LeetCode]Construct Binary Tree from Inorder and Postorder Traversal
- [leetcode]Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode-Construct Binary Tree from Inorder and Postorder Traversal
- [leetcode] Construct Binary Tree from Inorder and Postorder Traversal
- Java 多维数组遍历详解
- poj2386 Lake Counting
- 学习ThinkPHP3.2.2:了解并测试与3.1不同之处_自定义函数文件名称
- 【J2EE系列】—Servlet
- Unity 5 中的全局光照技术详解(建议收藏)
- LeetCode题解:Construct Binary Tree from Inorder and Postorder Traversal
- 将博客搬至CSDN
- HDU 5451 Best Solver(矩阵快速幂+ 共轭复数 + 循环节 数论啊 )
- JAVA实现链表的反转(《剑指offer》)
- 学习ThinkPHP3.2.2:模板文件的加载
- 对 Web 应用程序进行性能调优
- Multiply Strings
- 学习ThinkPHP3.2.2:模板文件所需css文件位置
- Codeforces Round #322 (Div. 2)C. Developing Skills