[Leetcode] #105 Construct Binary Tree from Preorder and Inorder Traversal
2017-02-11 19:49
561 查看
Discription:
Given preorder and inorder traversal of a tree, construct the binary tree.Note:
You may assume that duplicates do not exist in the tree.
Solution:
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder, int ps, int pe, int is, int ie) { if (ps > pe) return NULL; TreeNode *root = new TreeNode(preorder[ps]); int x; for (int i = is; i <= ie; i++){ if (inorder[i] == root->val){ x = i; break; } } root->left = buildTree(preorder, inorder, ps + 1, ps + x - is, is, x - 1); root->right = buildTree(preorder, inorder, pe - ie + x + 1, pe, x + 1, ie); return root; } TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) { return buildTree(preorder, inorder, 0, preorder.size() - 1, 0, inorder.size() - 1); }
GitHub-LeetCode: https://github.com/wenwu313/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, Medium] Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode(105) Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode: Construct Binary Tree from Preorder and Inorder Traversal [105]
- [Leetcode 78] 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
- [JAVA]LeetCode105 Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode 105/106 Construct Binary Tree from Preorder/Postorder and Inorder Traversal
- 【LeetCode-面试算法经典-Java实现】【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 | 根据前序和中序遍历构建二叉树 | Medium
- [leetcode-105]Construct Binary Tree from Preorder and Inorder Traversal(java)