Leetcode 106 Construct Binary Tree from Inorder and Postorder Traversal（二叉树）

JeraKrs

于 2018-06-19 00:29:27 发布

阅读量134

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/keshuai19940722/article/details/80727814

版权

Leetcode 专栏收录该内容

151 篇文章 0 订阅

订阅专栏

题目连接：Leetcode 106 Construct Binary Tree from Inorder and Postorder Traversal

解题思路：参考 Leetcode 105。

/**
 * 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* build(int& p, int start, int end, vector<int>& inorder, vector<int>& postorder) {
			if (start > end) return NULL;
			TreeNode* ret = new TreeNode(postorder[p--]);
			if (start == end) return ret;

			int t = start;
			while (t <= end && inorder[t] != postorder[p+1]) t++;

			ret->right = build(p, t+1, end, inorder, postorder);
			ret->left = build(p, start, t-1, inorder, postorder);
			return ret;
		}

		TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
			int p = postorder.size() - 1;
			return build(p, 0, inorder.size()-1, inorder, postorder);
		}
};