TOJ-1144（已知先序和中序求后序遍历）

最新推荐文章于 2022-12-20 18:15:00 发布

famousDT

最新推荐文章于 2022-12-20 18:15:00 发布

阅读量388

点赞数

分类专栏：数据结构文章标签： struct string float date null c

本文链接：https://blog.csdn.net/famousDT/article/details/7046319

版权

数据结构专栏收录该内容

31 篇文章 0 订阅

订阅专栏

/******************************************************************************************************
 ** Copyright (C) 2011.07.01-2013.07.01
 ** Author: famousDT <13730828587@163.com>
 ** Edit date: 2011-12-06
******************************************************************************************************/
#include <stdio.h>
#include <stdlib.h>//abs,atof(string to float),atoi,atol,atoll
#include <math.h>//atan,acos,asin,atan2(a,b)(a/b atan),ceil,floor,cos,exp(x)(e^x),fabs,log(for E),log10
#include <vector>
#include <queue>
#include <map>
#include <time.h>
#include <set>
#include <list>
#include <stack> 
#include <string>
#include <iostream>
#include <fstream>
#include <assert.h>
#include <bitset>
#include <iterator>//C++Primer
#include <string.h>//memcpy(to,from,count
#include <ctype.h>//character process:isalpha,isdigit,islower,tolower,isblank,iscntrl,isprll
#include <algorithm>
using namespace std;

//typedef long long int ll;

#define MY_PI acos(-1)
#define MY_MAX(a, b) ((a) > (b) ? (a) : (b))
#define MY_MIN(a, b) ((a) < (b) ? (a) : (b))
#define MY_MALLOC(n, type) ((type *)malloc((n) * sizeof(type)))
#define MY_ABS(a) (((a) >= 0) ? (a) : (-(a)))
#define MY_INT_MAX 0x7fffffff

/*==========================================================*\
| 
\*==========================================================*/
typedef struct node
{
	char data;
	struct node * left;
	struct node * right;
} n;
n * create(n * root, char a[], char b[], int len)
{
	int i;
	if (len <= 0) return NULL;
	root->data = a[0];
	for (i = 0; i < len; ++i) {
		if (b[i] == a[0]) {
			break;
		}
	}
	root->left = (struct node *)malloc(sizeof(struct node));
	root->right = (struct node *)malloc(sizeof(struct node));
	root->left = create(root->left, a + 1, b, i);
	root->right = create(root->right, a + 1 + i, b + i + 1, len - i - 1);
	return root;
}
void postorder(n * root)
{
	if (root != NULL) {
		postorder(root->left);
		postorder(root->right);
		printf("%c", root->data);
	}
}
int main()
{
	char a[30], b[30];
	while (scanf("%s%s", a, b) == 2) {
		n * root = (struct node *)malloc(sizeof(struct node));
		create(root, a, b, strlen(a));
		postorder(root);
		printf("\n");
	}
    return 0;
}