Construct Binary Tree from Inorder and Preorder(Inorder and Postorder) Traversal
来源:互联网 发布:最好网络武侠小说 编辑:程序博客网 时间:2024/06/07 23:21
题目:
Given inorder and preorder( inorder and postorder )traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
思想:
由树的遍历可知,由中序遍历与后序遍历,或是由中序遍历与先序遍历,均能够确定一棵二叉树。以先序遍历为例,首先根据先序遍历找到根节点,即先序遍历的preorder[0],然后在中序遍历中找到与preorder[0]相等的数inorder[i] 。这样就把inorder分成了两部分,inorder[0] ~inorder[i-1] ,构成preorder [0] 的左子树,inorder[i+1]~inorder[end]构成preorder[0]的右子树。preorder也被分成两部分,preorder[1]~preorder[1+i] 和preorder[i+2]~preorder[end]两部分,分别为左子树和右子树两个部分。然后递归的构建左子树和右子树即可。后序遍历只要以postorder[end]为根即可。
代码:
/*** Definition for a binary tree node.*/struct TreeNode {int val;TreeNode *left;TreeNode *right;TreeNode(int x) : val(x), left(NULL), right(NULL) {}};class Solution {public:TreeNode* build(vector<int> &inorder, int istart, int iend, vector<int> &postorder, int pstart, int pend){TreeNode *T = new TreeNode(postorder[pend]);if (pstart == pend && istart == iend){return T;}int k = 0;for (int i = istart; i <= iend; i++){if (inorder[i] == postorder[pend])break;elsek++;}if ((k - 1) >= 0)T->left = build(inorder, istart, istart + k - 1, postorder, pstart, pstart + k - 1);if ((iend - istart - k - 1) >= 0)T->right = build(inorder, istart + k + 1, iend, postorder, pstart + k , pend-1);return T;}TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) //后序和中序{TreeNode *T = NULL;if (inorder.size() == NULL || postorder.size() == NULL){return T;}T = build(inorder, 0,inorder.size() - 1, postorder, 0, postorder.size() - 1);return T;}void preorder(TreeNode* root){if (root != NULL){cout << root->val << " ";preorder(root->left);preorder(root->right);}}};TreeNode* build(vector<int> &preorder, int pstart, int pend, vector<int> &inorder, int istart, int iend){TreeNode *T = new TreeNode(preorder[pstart]);if (pstart==pend && istart==iend){return T ;}int k = 0;for (int i = istart; i <= iend; i++){if (inorder[i] == preorder[pstart])break;elsek++;}if ((k-1)>=0)T->left = build(preorder, pstart + 1, pstart + k, inorder, istart, istart + k - 1);if ( (pend - pstart - k -1) >= 0)T->right = build(preorder, pstart + k + 1, pend, inorder, istart + k + 1, iend);return T;}TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) //先序和中序{TreeNode *T = NULL;if (preorder.size() == NULL || inorder.size() == NULL){return T;}T = build(preorder, 0, preorder.size()-1, inorder, 0, inorder.size()-1);return T;}
0 0
- Construct Binary Tree from Inorder and Preorder(Postorder) Traversal
- Construct Binary Tree from Preorder (Postorder) and Inorder Traversal
- 【Leetcode】Construct Binary Tree From Inorder and Preorder/Postorder Traversal
- Construct Binary Tree from Inorder and Preorder(Inorder and Postorder) Traversal
- Construct Binary Tree from Inorder and Postorder Traversal & Preorder and Inorder
- [Leetcode] Construct Binary Tree from Inorder and Postorder/Preorder and Inorder Traversal
- leetCode(18):Construct Binary Tree from Preorder and Inorder (Inorder and Postorder) Traversal
- LeetCode 105, 106. Construct Binary Tree from Preorder and Inorder/Inorder and Postorder Traversal
- 【Leetcode】【python】Construct Binary Tree from Preorder and Inorder Traversal (Inorder and Postorder)
- Construct Binary Tree from Inorder and Postorder Traversal(medium)
- 【LeetCode】Construct Binary Tree from (Preorder or Postorder) and Inorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal (medium)
- Construct Binary Tree from Preorder and Inorder Traversal & Construct Binary Tree from Inorder and P
- *(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 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
- Howie带你云上飘-新浪云
- 有本事你别做好PPT!——特种兵浅谈做好PPT的几点好处
- leetcode 134 —— Gas Station
- Polar Code主要研究者的个人主页(持续更新中........)
- HDU5379.Mahjong tree
- Construct Binary Tree from Inorder and Preorder(Inorder and Postorder) Traversal
- 【转】Web 开发调试工具 Livepool
- android定位和地图开发实例
- Git 查看修改历史
- 2015-8-13 省赛模拟总结
- scala-07Scala类的属性和对象私有字段实战详解
- vector用法
- hdu1312
- hdu 5374 Tetris(模拟俄罗斯方块)