数据结构教学-web英语试题.pdfVIP

试卷（一）

I.Single-choice(21points=1.5×14)

1.Onthefollowingdatastructures,()isnon-lineardatastructure.

A.arrayB.stackC.queueD.graph

2.()isthehighestinthefollowingterms?

2310

A.log(n)B.2n+3nC.nlog(n)D.2

22

3.Whichlinearlistisbettertogettheelementsforagivenindexandinsertordelete

inthelastlocation?()

A.doublycircularlylinkedlistB.doublylinkedlist

C.arrayD.singlycircularly

linkedlist

4.WhataretheBig-ONotationsforarraytoinsertordeleteelementandaccess

element?()

A.O(n)O(n)B.O(n)O(1)C.O(1)O(n)D.O(1)

O(1)

5.Insertanodewithpointersafterthenodewithpointerpinthesinglylist:()

A.s-next=p-next;p-next=s;B.p-next=s;s-next=p-next;

C.p-next=s;p-next=s-next;D.p-next=s-next;p-next=s;

6.Theinputofastackisabcde，andtheoutputofthisstackcan’tbe()

A.edacbB.bcdaeC.bcadeD.ae

dcb

7.Ifabinarytreehas13nodeswithtwodegreesand6nodeswithonedegree,how

manynodesaretherewithzerodegree?()

A.7