首页 > 代码库 > Construct Binary Tree from Inorder and Postorder Traversal
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) { return build(inorder,0,inorder.size()-1,postorder,0,postorder.size()-1); } TreeNode *build(vector<int> &inorder,int inl,int inr, vector<int> &postorder,int pl,int pr) { if(inl>inr) return NULL; TreeNode *root=new TreeNode(postorder[pr]); int index=inl; while(inorder[index]!=postorder[pr]) index++; root->left=build(inorder,inl,index-1,postorder,pl,pl+index-inl-1); root->right=build(inorder,index+1,inr,postorder,pr-(inr-index),pr-1); } };
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。