中国大学MOOC-陈越、何钦铭-数据结构-2020春期末考试-还原二叉树-编程题

解题代码

#include<iostream>
#include<stdlib.h>
#include<string>
using namespace std;
typedef struct TNode *Tree;
struct TNode {
	char key;
	Tree left, right;
};
char Pre[51], Mid[51];
void CreatTree(int Preleft, int Midleft, int size, Tree T);
int GetHeight(Tree T);
int Max(int left, int right);
int main()
{
	int N;
	cin >> N >> Pre >> Mid;
	Tree T;
	T = (Tree)malloc(sizeof(struct TNode));
	T->left = T->right = NULL;
	CreatTree(0,0, N,T);
	int H =GetHeight(T);
	cout << H;
	return 0;
}
void CreatTree(int Preleft,int Midleft,int size,Tree T) {
	if (size<0) return;
	T->key = Pre[Preleft];
	int i = 0;
	while (Mid[Midleft + i++] != T->key) {};
	i--;
	if (i > 0) {
		T->left = (Tree)malloc(sizeof(struct TNode));
		T->left->left = T->left->right = NULL;
		CreatTree(Preleft + 1,Midleft,i,T->left);
	}
	if (i < size - 1) {
		T->right = (Tree)malloc(sizeof(struct TNode));
		T->right->left = T->right->right = NULL;
		CreatTree(Preleft + i + 1,Midleft + i + 1,size-i-i, T->right);
	}
}
int GetHeight(Tree T) {
	if (!T) return 0;
	return  Max(GetHeight(T->left), GetHeight(T->right)) + 1;
}
int Max(int left, int right) {
	return left > right ? left : right;
}

测试结果

问题整理

1.考试中还是思路凌乱。