1.輸入一串?dāng)?shù)，然后，建立鏈表，排序輸出。#include<stdio.h>typedefstructNode{intdata;structNode*next;}linknode,*linklist;linklistCreate(linklistL){inta;linknode*p,*q,*k;L=(structlinknode*)malloc(sizeof(linknode));L->next=NULL;p=L;scanf("%d",&a);while(a!=0){ q=(structlinknode*)malloc(sizeof(linknode)); q->next=NULL; q->data=a; if(L->next!=NULL) {k=L; p=L->next; if(p->data>a) { k->next=q; q->next=p; } else { while(p->data<=a&&p->next!=NULL) { k=p;p=p->next;}if(p->next==NULL&&p->data<=a) p->next=q; else { k->next=q; q->next=p; } } } elsep->next=q; scanf("%d",&a);}returnL;}voidPrint(linklistL){linknode*p;p=L->next; if(p==NULL) return; while(p!=NULL) { printf("%d",p->data); p=p->next; }}voidInsert(linklistL){}main(){linklistL;L=Create(L);Print(L);}2.計(jì)算26個(gè)字母的輸入次數(shù)，好像不區(qū)分大小寫。#include<stdio.h>#include<string.h>main(){charf[200];inti,b,k,s[200];scanf("%s",f);b=strlen(f)-1;for(k=65;k<=90;k++) s[k]=0;for(k=65;k<=90;k++)for(i=0;i<=b;i++){inti,k;scanf("%s",name);k=strlen(name);if(k>32){printf("Error!\n");return;}if(name[0]=='_'){printf("OK!\n");return;}for(i=65;i<90;i++){ ch1=i; ch2=i+32; if(name[0]==ch1||name[0]==ch2) {printf("OK!\n"); break; }}if(i==90)printf("Error!\n");}中序建立一個(gè)樹，中序輸出#include<stdio.h>typedefstructtree{intdata;structtree*lchild;structtree*rchild;}Tree;Tree*Create(){intk;Tree*T;scanf("%d",&k);if(k==0) returnNULL;else{T=(structTree*)malloc(sizeof(Tree));T->data=k;T->lchild=Create();T->rchild=Create();returnT;}}voidprint(Tree*T){if(T==NULL) returnNULL;else{printf(