方法一:构建二叉树方法
#include<bits/stdc++.h>
using namespace std;
char zh[20],hou[20],qi[20];
struct node{
char le;
node *l;
node *r;
};
int chazhao(char zh[],char ch)
{
for(int i = 0; i < strlen(zh); i++)
if(zh[i]==ch) {
return i;
}
}
void work(node *q,char *zh ,char *hou)
{
if(strlen(zh)==0){
// q = NULL;
q->le = '0';
q->l = NULL;
q->r = NULL;
return;
}
int mid = chazhao(zh,hou[strlen(hou)-1]);
q->le = hou[strlen(hou)-1];
node *lc=new node,*rc=new node;
lc->l=NULL;lc->r=NULL;
rc->l=NULL;rc->r=NULL;
q->l = lc;
q->r = rc;
char zhl[20],zhr[20],houl[20],hour[20];
// A
// A
strncpy(zhl,zh,mid);zhl[mid] = '\0';//DBFE
strncpy(zhr,zh+mid+1,strlen(zh)-mid-1);zhr[strlen(zh)-mid-1] = '\0';//CG
strncpy(houl,hou,mid);houl[mid] = '\0';//DFEB
strncp