the reason of failure:1、将一个字符串从i到len分成两份的时候,若为偶数,注意第二份的开头是len/2+1
题意:给一串01码,把01码分割成左右两份,左结点放左份,右结点放右份,然后判断这份结点包括有"0"和"1"则为F结点,
如果只包含"0"则为B结点,只包含"1"则为I结点。
代码:
#include<iostream>
#include <stdlib.h>
#include <math.h>
using namespace std;
struct tree{
char data;
tree *left; //为tree类型的指针
tree *right;
};
typedef struct tree *b_tree; //b_tree 定义的便为一个tree的指针了
b_tree insert(char node[],int len){
b_tree newnode;
b_tree rightnode;
b_tree leftnode;
newnode=(b_tree)malloc(sizeof(tree));// 为这个指针分配内存
int i;
bool f1=0,f2=0;
for(i=1;i<=len;i++){
if(node[i]=='1')f1=1;
if(node[i]=='0')f2=1;
}
if(f1&&f2){
newnode->data='F';
}else if(f1&&!f2){
newnode->data='I';
}else{
newnode->data='B';
}
newnode->right=NULL;
newnode->left=NULL;
if(len>=2){
char right[len/2+1];
char left[len/2+1];
for(i=1;i<=len/2;i++)
left[i]=node[i];
for(i=len/2+1;i<=len;i++)
right[i-len/2]=node[i];
newnode->right=insert(right,len/2);
newnode->left=insert(left,len/2);
}
return newnode;
}
void print(b_tree root){
if(root!=NULL){
print(root->left);
print(root->right);
printf("%c ",root->data);
}
}
int main(){
freopen("in.txt","r",stdin);
b_tree root;
int n,i;
cin >> n;
n=pow(2,n);
char node[n+1];
for(i=1;i<=n;i++)
cin >> node[i];
root=insert(node,n);
print(root);
return 0;
}