construct-binary-tree-from-preorder-and-inorder-traversal
来源:互联网 发布:windows各系统 编辑:程序博客网 时间:2024/05/16 12:53
1、来源:construct-binary-tree-from-preorder-and-inorder-traversal
Given preorder and inorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
2、思路:
- 先序的第一个元素是根结点,在中序中,该结点将数组分为左右两部分,分别代表左右子树,再递归即可;
3、代码:
public TreeNode buildTree(int[] preorder, int[] inorder) { if(preorder == null || preorder.length == 0){ return null; } return biuld(preorder, 0, preorder.length - 1,inorder, 0, inorder.length - 1); } private TreeNode biuld(int[] preorder, int start1, int end1, int[] inorder, int start2, int end2) { int root_val = preorder[start1]; TreeNode root = new TreeNode(root_val); int mid; for(mid = start2; mid < end2; mid ++){ if(inorder[mid] == root_val) break; } int left_num = mid - start2;//左子树节点数目 int right_num = end2 - mid;//右子树节点数目 if(left_num > 0){ root.left = biuld(preorder, start1 + 1, start1 + left_num, inorder, start2, mid - 1); } if(right_num > 0){ root.right = biuld(preorder, start1 + left_num + 1, end1, inorder, mid + 1, end2); } return root; }
阅读全文
0 0
- *(leetcode) Construct Binary Tree from Preorder and Inorder Traversal (tree)
- LeetCode[Tree]: Construct Binary Tree from Preorder and Inorder Traversal
- [leetcode][tree] Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal & Construct Binary Tree from Inorder and P
- LeetCode: Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode]Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode Construct Binary Tree from Preorder and Inorder Traversal
- [Leetcode] Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode: Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode] Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode Construct Binary Tree from Preorder and Inorder Traversal
- leetcode 109: Construct Binary Tree from Preorder and Inorder Traversal
- 【leetcode】Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode]Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- 算法提高 概率计算
- 20171022 练习
- 愤怒的小鸟
- leetcode 45. Jump Game II
- 旅游网站推广经验的个人心得和看法!
- construct-binary-tree-from-preorder-and-inorder-traversal
- xxx定律
- Python在控制台调试程序
- JAVA插入Windows32位mongoDB数据库sockect write error异常的解决
- THE POM for ... is missing,no dependency information available
- node.js的Express框架起步
- 获取子控件在父控件中下标
- python 爬虫初学项目一(80s电影网)
- 重新编辑regular expression match