PAT A 1020 编程错误更正

由于我在for循环中又int k了，所以导致k被重复定义，导致错误,千万记住已经被定义的变量不能再定义一遍.

#include<iostream>
#include<Cstring>
#include<queue>
#include<algorithm> 
using namespace std;
const int maxn=50;
struct node{
	node* lchild;
	node* rchild;
	int data;
}; 
int pre[maxn],in[maxn],post[maxn];
int n;
node* create(int postL,int postR,int inL,int inR){
	if(postL>postR){
		return NULL;
	}
	node* root = new node;
	root->data = post[postR];
	int k;
	for(int k=inL;k<=inR;k++){
		if(in[k]==post[postR]){
			break;
		}
	}
	int numLeft=k-inL;
	root->lchild=create(postL,postL+numLeft-1,inL,k-1);
	root->rchild=create(postL+numLeft,postR-1,k+1,inR);
	return root;
}
int num=0;
void BFS(node* root){
	queue<node*> q;
	q.push(root);
	while(!q.empty()){
		node* now = q.front();
		q.pop();
		cout<<now->data;
		num++;
		if(num<n) cout<<" ";
		if(now->lchild!=NULL) q.push(now->lchild);
		if(now->rchild!=NULL) q.push(now->rchild);
	}
}
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>post[i];
	}
	for(int i=0;i<n;i++){
		cin>>in[i];
	}
	node* root=create(0,n-1,0,n-1);
	BFS(root);
	return 0;
}

#include<iostream>
#include<Cstring>
#include<queue>
#include<algorithm> 
using namespace std;
const int maxn=50;
struct node{
	node* lchild;
	node* rchild;
	int data;
}; 
int pre[maxn],in[maxn],post[maxn];
int n;
node* create(int postL,int postR,int inL,int inR){
	if(postL>postR){
		return NULL;
	}
	node* root = new node;
	root->data = post[postR];
	int k;
	for(k=inL;k<=inR;k++){
		if(in[k]==post[postR]){
			break;
		}
	}
	int numLeft=k-inL;
	root->lchild=create(postL,postL+numLeft-1,inL,k-1);
	root->rchild=create(postL+numLeft,postR-1,k+1,inR);
	return root;
}
int num=0;
void BFS(node* root){
	queue<node*> q;
	q.push(root);
	while(!q.empty()){
		node* now = q.front();
		q.pop();
		cout<<now->data;
		num++;
		if(num<n) cout<<" ";
		if(now->lchild!=NULL) q.push(now->lchild);
		if(now->rchild!=NULL) q.push(now->rchild);
	}
}
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>post[i];
	}
	for(int i=0;i<n;i++){
		cin>>in[i];
	}
	node* root=create(0,n-1,0,n-1);
	BFS(root);
	return 0;
}