题目链接:
hdu3999 The order of a Tree
题意:
给一个二叉搜索树的序列,求输出可以构成这个二叉搜索树的且满足字典序最小的插入序列
找了一个比较具体描述怎么根据序列建立二叉搜索树的
图片来自:https://blog.csdn.net/qq_39290830/article/details/85197994
思路:
首先,根据输入键的顺序,构造对应的二叉搜索树;然后,前序遍历这棵二叉树,得出的
树的顺序就是以最小的字典序生成的相同形状的树。
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <sstream>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1000005;
struct Treenode
{
int data;
Treenode *lch, *rch;
};
int arr[maxn],cnt;
Treenode *Creat(Treenode *rt,int val)
{
if(rt == NULL){
rt = new Treenode;
rt->data = val;
rt->lch = rt->rch = NULL;
return rt;
}
//保证小的都是靠左边的
if(rt->data > val){
rt->lch = Creat(rt->lch,val);
}
//保证靠右半部分的都是较大的数
else{
rt->rch = Creat(rt->rch,val);
}
return rt;
}
void for_order(Treenode *rt)
{
if(rt == NULL){
return ;
}
arr[cnt] = rt->data;
cnt++;
for_order(rt->lch);
for_order(rt->rch);
}
int main()
{
int n;
cin>>n;
Treenode *rt = NULL;
while(n--){
int val;
cin>>val;
rt = Creat(rt,val);
}
for_order(rt);
for(int i = 0; i < cnt - 1; i++){
cout<<arr[i]<<' ';
}
cout<<arr[cnt - 1]<<endl;
return 0;
}