LeetCode之Construct Binary Tree from Inorder and Postorder Traversal

最新推荐文章于 2014-07-03 23:35:26 发布

wteo

最新推荐文章于 2014-07-03 23:35:26 发布

阅读量866

点赞数

分类专栏： LeetCode leetcode

本文链接：https://blog.csdn.net/smileteo/article/details/22894279

版权

LeetCode 同时被 2 个专栏收录

55 篇文章 0 订阅

订阅专栏

leetcode

46 篇文章 0 订阅

订阅专栏

Given inorder and postorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

与Construct Binary Tree from Preorder and Inorder Traversal细微差别。

/**
 * 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(postorder, 0, postorder.size() - 1, inorder, 0, inorder.size()-1);
    }
    
    TreeNode* build(vector<int> & postorder, int  pos_first, int  pos_last,
					 vector<int> & inorder, int  in_first, int  in_last){
		 if (pos_first > pos_last || in_first > in_last)
			 return NULL;
		 TreeNode* root = new TreeNode(postorder[pos_last]);
		 int offset;
		 for (int i = in_first; i <= in_last;i++)
			if (postorder[pos_last] == inorder[i]){
				offset = i - in_first; break;
			}
		root->left = build(postorder, pos_first , pos_first + offset-1, inorder, in_first, in_first+offset-1);
		root->right = build(postorder, pos_first + offset , pos_last-1, inorder, in_first+ offset+1,in_last);
	 }
};