首页 > 代码库 > 【Leetcode长征系列】Construct Binary Tree from Inorder and Postorder Traversal
【Leetcode长征系列】Construct Binary Tree from Inorder and Postorder Traversal
原题:
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
代码:
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: TreeNode *buildTree(vector<int> &inorder, vector<int> &postorder) { if(inorder.empty()||postorder.empty()) return NULL; return make(postorder.begin(), postorder.end(), inorder.begin(), inorder.end()); } TreeNode *make(vector<int>::iterator pFirst, vector<int>::iterator pEnd, vector<int>::iterator iFirst, vector<int>::iterator iEnd){ if(pFirst==pEnd||iFirst==iEnd) return NULL; TreeNode *root = new TreeNode(*(pEnd-1)); vector<int>::iterator iRoot = find(iFirst, iEnd, root->val); int rightsize = iEnd-iRoot; root->left = make(pFirst, pEnd-rightsize, iFirst, iRoot); root->right = make(pEnd-rightsize-1, pEnd-1, iRoot+1, iEnd); return root; } };AC
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。