首页 > 代码库 > Construct Binary Tree from Preorder and Inorder Traversal
Construct Binary Tree from Preorder and Inorder Traversal
这里使用递归的算法,特别需要递归中边界的判断
/** * 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 buildTree(preorder.begin(), preorder.end(), inorder.begin(), inorder.end()); } typedef vector<int>::iterator inIterator; TreeNode* buildTree(inIterator prefirst, inIterator prelast, inIterator infirst, inIterator inlast) { if(prefirst == prelast) return nullptr; if(infirst == inlast) return nullptr; vector<int>::iterator iter = find(infirst, inlast, *prefirst); int dis = distance(infirst, iter); TreeNode *res = new TreeNode(*prefirst); res->left = buildTree(prefirst+1, prefirst+dis+1, infirst, iter); res->right = buildTree(prefirst+1+dis, prelast, iter+1, inlast); return res; } };
Construct Binary Tree from Preorder and Inorder Traversal
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。