面试题7:重建二叉树
题目:输入某二叉树前序遍历和中序遍历结果,请重建该二叉树,假设输入的前序遍历和中序遍历结果中都不含有重复的数字。
思路:前序遍历中,根结点在第一个数字处;在中序遍历中,根结点在中间的位置。在数字不重复的假设下,可以根据前序遍历中获取的根节点值找到中序遍历中根结点所在的位置,然后中序遍历中根结点所在的位置左边就是左子树序列,右边就是右子树序列。通过递归分别对左子树序列和右子树序列进行处理,即可得到该二叉树。
提示:前序遍历:根-》左-》右;中序遍历:左-》根-》右
代码:
#include "BTree.h"
BTreeNode* construct(int* preorder, int* inorder, int length);
BTreeNode* constrctCore(int* preStart, int* preEnd, int* inStart, int* inEnd);
int main() {
int preorder[] = {1,2,4,7,3,5,6,8};
int inorder[] = {4,7,2,1,5,3,8,6};
//重建
BTreeNode* root = construct(preorder, inorder, 8);
//前序遍历打印
preorderTraversal(root);
cout << endl;
return 0;
}
//重建
BTreeNode* construct(int* preorder, int* inorder, int length) {
if (preorder == nullptr || inorder == nullptr || length <= 0) return nullptr;
return constrctCore(preorder, preorder + length - 1, inorder, inorder + length - 1);
}
//重建核心
BTreeNode* constrctCore(int* preStart, int* preEnd, int* inStart, int* inEnd) {
int rootValue = *preStart;
BTreeNode *root = new BTreeNode();
root->value = rootValue;
root->leftChild = nullptr;
root->rightChild = nullptr;
//找到根结点在中序遍历中的位置
int* rootOrder = inStart;
while (rootOrder <= inEnd&&*rootOrder != rootValue) {
rootOrder++;
}
if (rootOrder == inEnd&&*rootOrder != rootValue) {
throw exception("invalid input");
return nullptr;
}
//找到了根结点在中序遍历中的位置
//添加左子树
int leftLength = rootOrder - inStart;
if (leftLength > 0) {
int *leftPreEnd = preStart + leftLength;
if (leftPreEnd > preEnd) {
throw exception("invalid input");
return nullptr;
}
root->leftChild = constrctCore(preStart + 1, leftPreEnd, inStart, rootOrder - 1);
}
//添加右子树
int rightLength = inEnd - rootOrder;
if (rightLength > 0 && leftLength < preEnd - preStart) {
int *rightPreStart = preStart + leftLength + 1;
if (rightPreStart > preEnd) {
throw exception("invalid input");
return nullptr;
}
root->rightChild = constrctCore(rightPreStart, preEnd, rootOrder + 1, inEnd);
}
return root;
}
BTree.h:
#ifndef _FILE_B_TREE_H_
#define _FILE_B_TREE_H_
#include<iostream>
using namespace std;
typedef struct BTreeNode{
int value;
struct BTreeNode* leftChild;
struct BTreeNode* rightChild;
}BTreeNode;
//前序遍历
void preorderTraversal(BTreeNode *root);
#endif
BTree.cpp:
#include "BTree.h"
//前序遍历
void preorderTraversal(BTreeNode *root) {
if (root != nullptr) {
cout << root->value << ",";
//前序便利左孩子
preorderTraversal(root->leftChild);
//前序遍历右孩子
preorderTraversal(root->rightChild);
}
}