9. O(1)
10. i/2£¬2i+1
11. (5£¬16£¬71£¬23£¬72£¬94£¬73) 12. (1£¬4£¬3£¬2)
13. j+1£¬hashtable[j].key==k 14. return(t)£¬t=t->rchild
µÚ8СÌâ·ÖÎö£º¶þ·Ö²éÕҵĹý³Ì¿ÉÒÔÓÃÒ»¿Ã¶þ²æÊ÷À´ÃèÊö£¬¸Ã¶þ²æÊ÷³ÆÎª¶þ²æÅж¨Ê÷¡£ÔÚÓÐÐò±íÉϽøÐжþ·Ö²éÕÒʱµÄ²éÕÒ³¤¶È²»³¬¹ý¶þ²æÅж¨Ê÷µÄ¸ß¶È1+log2n¡£
Èý¡¢¼ÆËãÌâ 1£®
AEFNULLDHFKJGBC 2¡¢H(36)=36 mod 7=1; H£±(22)=(1+1) mod 7=2; ¡.³åÍ»
H(15)=15 mod 7=1;¡.³åÍ» H2(22)=(2+1) mod 7=3; H£±(15)=(1+1) mod 7=2; H(40)=40 mod 7=5; H(63)=63 mod 7=0;
H(22)=22 mod 7=1; ¡.³åÍ»
£¨1£© 0 1 2 3 4 5 6
63 36 15 22 40 £¨2£©ASL=
1?2?1?1?3?1.6
53¡¢(8,9,4,3,6,1),10,(12,18,18) (1,6,4,3),8,(9),10,12,(18,18) 1,(3,4,6),8,9,10,12,18,(18) 1,3,(4,6),8,9,10,12,18,18 1,3, 4,6,8,9,10,12,18,18
ËÄ¡¢Ëã·¨Éè¼ÆÌâ
1. Éè¼ÆÔÚµ¥Á´±íÖÐɾ³ýÖµÏàͬµÄ¶àÓà½áµãµÄËã·¨¡£
typedef int datatype;
typedef struct node {datatype data; struct node *next;}lklist; void delredundant(lklist *&head)
29
{
lklist *p,*q,*s;
for(p=head;p!=0;p=p->next) {
for(q=p->next,s=q;q!=0; )
if (q->data==p->data) {s->next=q->next; free(q);q=s->next;} else {s=q,q=q->next;} } }
2. Éè¼ÆÒ»¸öÇó½áµãxÔÚ¶þ²æÊ÷ÖеÄË«Ç×½áµãËã·¨¡£
typedef struct node {datatype data; struct node *lchild,*rchild;} bitree; bitree *q[20]; int r=0,f=0,flag=0; void preorder(bitree *bt, char x) {
if (bt!=0 && flag==0)
if (bt->data==x) { flag=1; return;}
else {r=(r+1)% 20; q[r]=bt; preorder(bt->lchild,x); preorder(bt->rchild,x); } }
void parent(bitree *bt,char x) {
int i;
preorder(bt,x);
for(i=f+1; i<=r; i++) if (q[i]->lchild->data==x || q[i]->rchild->data) break; if (flag==0) printf(\
else if (i<=r) printf(\}
Êý¾Ý½á¹¹ÊÔ¾í£¨ËÄ£©²Î¿¼´ð°¸
Ò»¡¢Ñ¡ÔñÌâ
1£®C 2£®D 3£®D 4£®B 6£®A 7£®B 8£®A 9£®C
¶þ¡¢Ìî¿ÕÌâ
2
1. O(n)£¬O(nlog2n)
2. p>llink->rlink=p->rlink; p->rlink->llink=p->rlink 3. 3
k-1
4. 2 5. n/2 6. 50£¬51
7. m-1£¬(R-F+M)%M 8. n+1-i£¬n-i
30
5£®C 10£®A
9. (19£¬18£¬16£¬20£¬30£¬22) 10. (16£¬18£¬19£¬20£¬32£¬22) 11. A[i][j]=1 12. µÈÓÚ 13. BDCA
14. hashtable[i]=0£¬hashtable[k]=s
Èý¡¢¼ÆËãÌâ 1£® LS1^---->110e---->11^---->10a1^---->10b---->10c^0d^1
2£®
(1) ABCDEF; BDEFCA£»(2) ABCDEFGHIJK; BDEFCAIJKHGÁÖת»»ÎªÏàÓ¦µÄ¶þ²æÊ÷£»
ABCDEFIJKHG 3£®H(4)=H(5)=0,H(3)=H(6)=H(9)=2,H(8)=3,H(2)=H(7)=6 0123456789456^9^38^^^^^^27^
ËÄ¡¢Ëã·¨Éè¼ÆÌâ
1. Éèµ¥Á´±íÖÐÓнöÈýÀà×Ö·ûµÄÊý¾ÝÔªËØ(´óд×Öĸ¡¢Êý×ÖºÍÆäËü×Ö·û)£¬ÒªÇóÀûÓÃÔµ¥Á´±í
Öнáµã¿Õ¼äÉè¼Æ³öÈý¸öµ¥Á´±íµÄËã·¨£¬Ê¹Ã¿¸öµ¥Á´±íÖ»°üº¬Í¬Àà×Ö·û¡£ typedef char datatype;
typedef struct node {datatype data; struct node *next;}lklist; void split(lklist *head,lklist *&ha,lklist *&hb,lklist *&hc) {
31
lklist *p; ha=0,hb=0,hc=0; for(p=head;p!=0;p=head) {
head=p->next; p->next=0;
if (p->data>='A' && p->data<='Z') {p->next=ha; ha=p;}
else if (p->data>='0' && p->data<='9') {p->next=hb; hb=p;} else {p->next=hc; hc=p;} } }
2. Éè¼ÆÔÚÁ´Ê½´æ´¢½á¹¹ÉϽ»»»¶þ²æÊ÷ÖÐËùÓнáµã×óÓÒ×ÓÊ÷µÄËã·¨¡£
typedef struct node {int data; struct node *lchild,*rchild;} bitree; void swapbitree(bitree *bt) {
bitree *p;
if(bt==0) return;
swapbitree(bt->lchild); swapbitree(bt->rchild); p=bt->lchild; bt->lchild=bt->rchild; bt->rchild=p; }
3. ÔÚÁ´Ê½´æ´¢½á¹¹ÉϽ¨Á¢Ò»¿Ã¶þ²æÅÅÐòÊ÷¡£
#define n 10
typedef struct node{int key; struct node *lchild,*rchild;}bitree; void bstinsert(bitree *&bt,int key) {
if (bt==0){bt=(bitree *)malloc(sizeof(bitree)); bt->key=key;bt->lchild=bt->rchild=0;} else if (bt->key>key) bstinsert(bt->lchild,key); else bstinsert(bt->rchild,key); }
void createbsttree(bitree *&bt) {
int i;
for(i=1;i<=n;i++) bstinsert(bt,random(100)); }
Êý¾Ý½á¹¹ÊÔ¾í£¨Î壩²Î¿¼´ð°¸
Ò»¡¢Ñ¡ÔñÌâ 1£®A 2£®B 3£®A 4£®A 6£®B 7£®B 8£®B 9£®C
¶þ¡¢Ìî¿ÕÌâ
1. top1+1=top2
2. ¿ÉÒÔËæ»ú·ÃÎʵ½ÈÎÒ»¸ö¶¥µãµÄ¼òµ¥Á´±í 3. i(i+1)/2+j-1 4. FILO£¬FIFO
32
5£®D 10£®C