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) {
		return creatTree(inorder, 0, inorder.size() - 1, postorder, 0, postorder.size() - 1);
	}

	TreeNode *creatTree(vector<int> &inorder, int iL, int iR, vector<int> &postorder, int pL, int pR) {
		if (pL > pR)
			return NULL;
		if (pL == pR)
			return new TreeNode(postorder[pR]);
		
		TreeNode *head = new TreeNode(postorder[pR]);
		int mid = iL;
		while (mid <= iR && inorder[mid] != postorder[pR])
			mid++;
		head->left = creatTree(inorder, iL, mid - 1, postorder, pL, pR - iR + mid- 1);
		head->right = creatTree(inorder, mid + 1, iR, postorder, pR - iR + mid, pR - 1);
		return head;
	}
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值