105. Construct Binary Tree from Preorder and Inorder Traversal
来源:互联网 发布:win10禁止自动更新软件 编辑:程序博客网 时间:2024/06/05 14:27
问题描述
Given preorder and inorder traversal of a tree, construct the binary tree.Note:
You may assume that duplicates do not exist in the tree.解决思路
利用递归建树的思想,找到左右子树的list,然后递归下去,就可以了。代码
/** * 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* buildTree(vector<int>& preorder, vector<int>& inorder) { return helper(preorder,inorder,0,preorder.size()-1,0,inorder.size()-1); } TreeNode* helper(vector<int>& preorder, vector<int>& inorder, int pre_begin, int pre_end, int in_begin, int in_end) { if (pre_end < pre_begin) return NULL; TreeNode *root = new TreeNode(preorder[pre_begin]); int left_len = 0; for (int i = in_begin; i <=in_end; ++i) { if (inorder[i] == preorder[pre_begin]) break; ++left_len; } root->left = helper(preorder,inorder,pre_begin+1,pre_begin+left_len,in_begin,in_begin+left_len-1); root->right = helper(preorder,inorder,pre_begin+left_len+1,pre_end,in_begin+left_len+1,in_end); return root; }};
0 0
- 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
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal
- 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
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 广工校赛的水题
- Error: The Eclipse executable launcher was unable to locate its companion launcher jar 报错的解决办法
- Alamofire源码解读系列(二)之错误处理(AFError)
- gulp入门(11)- gulp-autoprefixer
- 快速记忆java抽象类和接口的区别
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 我为什么要写博客
- c++vector类常见用法
- oracle存储过程中is和as的区别
- hadoop学习笔记之前期准备 ubuntu16.04虚拟机安装、WMwareTools安装及网络配置
- 蓝桥杯 大臣的旅费(最短路)
- C#设计模式—— 单例模式
- JS 中元素的各种位置尺寸宽高
- Ajax-note