题目
给定节点数为 n 二叉树的前序遍历和中序遍历结果,请重建出该二叉树并返回它的头结点。
思路
根据中序遍历和前序遍历可以找到左子树和右子树,然后根据递归的方式进行重建。
代码
python版本:
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param pre int整型一维数组
# @param vin int整型一维数组
# @return TreeNode类
#
class Solution:
def reConstructBinaryTree(self , pre: List[int], vin: List[int]) -> TreeNode:
# write code here
if not pre:
return None
root = TreeNode(pre[0])
ind = vin.index(pre[0])
root.left = self.reConstructBinaryTree(pre[1:ind+1], vin[:ind])
root.right = self.reConstructBinaryTree(pre[ind+1:], vin[ind+1:])
return root
c++版本:
/**
* 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* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
if(pre.empty()){
return nullptr;
}
TreeNode *root = new TreeNode(pre[0]);
vector<int>::iterator it = find(vin.begin(), vin.end(), pre[0]);
int dis = distance(vin.begin(), it);
vector<int> pre_left(pre.begin()+1, pre.begin()+dis+1);
vector<int> vin_left(vin.begin(), vin.begin()+dis);
vector<int> pre_right(pre.begin()+dis+1, pre.end());
vector<int> vin_right(vin.begin()+dis+1, vin.end());
root->left = this->reConstructBinaryTree(pre_left, vin_left);
root->right = this->reConstructBinaryTree(pre_right, vin_right);
return root;
}
};