nyoj-1063生活の悩み

#include<iostream>
#include<string.h>
#include<queue>
#include<stack>
using namespace std;
const int max=100000;
typedef struct BiNode{
	string data;
	struct BiNode *lchild,*rchild;
}BiTNode,*BiTree;
string temp;
int flag=0;
int createBiTree(BiTree &M){
	flag=0;
	cin>>temp;
	if(temp.length()==1 && temp[0]=='#'){
	   M=NULL;
    }
    else
      flag=1;
    if(flag){
    	M=new BiTNode;
    	M->data=temp;
    	createBiTree(M->lchild);
    	createBiTree(M->rchild);
    	flag=0;
    }
    return 1;
}
queue<string>cas;
void preOrder(BiTree &M,int leval,int leval_goal){
	if(M==NULL)
	   return ;
	if(leval==leval_goal){
		cas.push(M->data);
		return ;
	}
	preOrder(M->lchild,leval+1,leval_goal);
	preOrder(M->rchild,leval+1,leval_goal);
}
int main(){
	int N;
	string str;
	int n,i,j,k,t;
	cin>>N;
	while(N--){
		BiTree L;//  
		createBiTree(L);//  
		cin>>str;
		cin>>n;
		preOrder(L,1,n);//  
		int number=cas.size();//  
		if(number>1){
			for(i=0;i<number-1;i++){
			  cout<<cas.front()<<"~";
			  cas.pop();
		}
		   cout<<cas.front()<<endl;
		   cas.pop();
		}
		else{
			cout<<cas.front()<<endl;
			cas.pop();
		}
	}
	return 0;
}