题目根据中序遍历序列重建最小堆,再用层次遍历输出
思路是先创建最小堆,再使用队列进行层次遍历输出。
首先是结构体
struct node{
int data;
node* left;
node* right;
}Tree;
创建最小堆
Node* buildHeap(int inl,int inr){
if(inl>inr)
return NULL;
int mid=INF;
int midi=0;
for(int i=inl;i<=inr;i++){
if(a[i]<mid){
mid=a[i];
midi=i;
}
}
Node* now=new Node();
now->data=mid;
now->left=buildHeap(inl,midi-1);
now->right=buildHeap(midi+1,inr);
return now;
}
层次遍历
queue<Node*>que;
que.push(root);
vector<int>ve;
while(!que.empty()){
Node* now=que.front();
que.pop();
ve.push_back(now->data);
if(now->left!=NULL){
que.push(now->left);
}
if(now->right!=NULL){
que.push(now->right);
}
}
全部代码
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdio>
#include<sstream>
#include<set>
#include<map>
#include<cmath>
#include<vector>
#include<unordered_map>
#include<queue>
using namespace std;
const int INF=0X3F3F3F3F;
int n;
const int maxn=1003;
int a[maxn];//中序遍历
int tree[8*maxn];
struct Node{
int data;
Node* left;
Node* right;
};
Node* buildHeap(int inl,int inr){
if(inl>inr)
return NULL;
int mid=INF;
int midi=0;
for(int i=inl;i<=inr;i++){
if(a[i]<mid){
mid=a[i];
midi=i;
}
}
Node* now=new Node();
now->data=mid;
now->left=buildHeap(inl,midi-1);
now->right=buildHeap(midi+1,inr);
return now;
}
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
// cout<<"ue"<<endl;
Node* root=buildHeap(0,n-1);
queue<Node*>que;
que.push(root);
vector<int>ve;
while(!que.empty()){
Node* now=que.front();
que.pop();
ve.push_back(now->data);
if(now->left!=NULL){
que.push(now->left);
}
if(now->right!=NULL){
que.push(now->right);
}
}
for(int i=0;i<ve.size();i++){
if(i==(int)ve.size()-1){
cout<<ve[i]<<endl;
}else{
cout<<ve[i]<<" ";
}
}
return 0;
}