MOOC 數(shù)據(jù)結(jié)構(gòu)與算法-北京大學(xué) 中國(guó)大學(xué)慕課答案

MOOC數(shù)據(jù)結(jié)構(gòu)與算法-北京大學(xué)中國(guó)大學(xué)慕課答案第一章概論測(cè)驗(yàn)1、問(wèn)題：下列不屬于線(xiàn)性結(jié)構(gòu)的是：Whichoneofthefollowingsdoesnotbelongtolinearstructure:（Thereisonlyonecorrectanswer）選項(xiàng)：A、隊(duì)列(queue)B、散列表(hashtable)C、向量(vector)D、圖(graph)正確答案:【圖(graph)】2、問(wèn)題：以下哪種結(jié)構(gòu)是邏輯結(jié)構(gòu)，而與存儲(chǔ)和運(yùn)算無(wú)關(guān)：Whichofthefollowingstructureisalogicalstructureregardlessofthestorageoralgorithm:（Thereisonlyonecorrectanswer）選項(xiàng)：A、隊(duì)列(queue)B、雙鏈表(doublylinkedlist)C、數(shù)組(array)D、順序表(Sequentiallist)正確答案:【隊(duì)列(queue)】3、問(wèn)題：關(guān)于算法特性描述正確的有：Whichoneisrightaboutalgorithm’scharacterization:（therearemorethanonecorrectanswers）選項(xiàng)：A、算法保證計(jì)算結(jié)果的正確性。Algorithmwillensurethecorrectnessofthecalculationresults.B、組成算法的指令可以有限也可能無(wú)限。InstructionswhichcompositealgorithmscanbeinfiniteorfiniteC、算法描述中下一步執(zhí)行的步驟不確定。Thenextstepintheimplementationofthealgorithmdescribedisuncertain.D、算法的有窮性指算法必須在有限步驟內(nèi)結(jié)束。Thefinitenatureofalgorithmsmeansalgorithmmustbecompletedwithinalimitedstep.正確答案:【算法保證計(jì)算結(jié)果的正確性。Algorithmwillensurethecorrectnessofthecalculationresults.#算法的有窮性指算法必須在有限步驟內(nèi)結(jié)束。Thefinitenatureofalgorithmsmeansalgorithmmustbecompletedwithinalimitedstep.】4、問(wèn)題：下列說(shuō)法正確的是：Whichoptionsmaybecorrect?（therearemorethanonecorrectanswers）選項(xiàng)：A、如果函數(shù)f(n)是O(g(n))，g(n)是O(h(n))，那么f(n)是O(h(n))【iff(n)isO(g(n))，g(n)isO(h(n))，thenf(n)isO(h(n))】B、如果函數(shù)f(n)是O(g(n))，g(n)是O(h(n))，那么f(n)+g(n)是O(h(n))【iff(n)isO(g(n))，g(n)isO(h(n))，sof(n)+g(n)isO(h(n))】C、如果ab1,是，但不一定是【ifab1,is，maynotbe】D、函數(shù)f(n)是O(g(n))，當(dāng)常數(shù)a足夠大時(shí)，一定有函數(shù)g(n)是O(af(n))【iff(n)是O(g(n))，Whenconstantaisbigenough，theremustbeg(n)isO(af(n))】正確答案:【如果函數(shù)f(n)是O(g(n))，g(n)是O(h(n))，那么f(n)是O(h(n))【iff(n)isO(g(n))，g(n)isO(h(n))，thenf(n)isO(h(n))】#如果函數(shù)f(n)是O(g(n))，g(n)是O(h(n))，那么f(n)+g(n)是O(h(n))【iff(n)isO(g(n))，g(n)isO(h(n))，sof(n)+g(n)isO(h(n))】】5、問(wèn)題：已知一個(gè)數(shù)組a的長(zhǎng)度為n，求問(wèn)下面這段代碼的時(shí)間復(fù)雜度:Anarrayofa,itslengthisknownasn.Pleaseanswerthetimecomplexityofthefollowingcode.（Therearemorethanoneanswers.）for(i=0,length=1;in-1;i++){for(j=i+1;jna[j-1]=a[j];j++)if(lengthj-i+1)length=j-i+1;}選項(xiàng)：A、B、C、D、正確答案:【#】6、填空題：計(jì)算運(yùn)行下列程序段后m的值：Calculatethevalueofmafterrunningthefollowingprogramsegmentn=9;m=0;for(i=1;i=n;i++)for(j=2*i;j=n;j++)m=m+1;求m的值正確答案:【20】7、填空題：由大到小寫(xiě)出以下時(shí)間復(fù)雜度的序列：答案直接寫(xiě)標(biāo)號(hào)，如：(1)(2)(3)(4)(5)（提示：系統(tǒng)基于字符匹配來(lái)判定答案，所以您的答案中不要出現(xiàn)空格）Writethefollowingtimecomplexityindescendingsequence:Writedowntheanswerlabelssuchas(1)(2)(3)(4)(5).（Hint：Thisproblemisjudgedbystringmatching,Pleasemakesureyouranswerdon'tcontainanyblanks.）正確答案:【(5)(1)(2)(4)(3)】第二章線(xiàn)性表測(cè)驗(yàn)1、問(wèn)題：下面關(guān)于線(xiàn)性表的敘述中，正確的是哪些？Whichofthefollowingsaboutlinearlistarecorrect?（Therearemorethanoneanswers.）Selecttheanswerthatmatches選項(xiàng)：A、線(xiàn)性表采用順序存儲(chǔ)，必須占用一片連續(xù)的存儲(chǔ)單元。Linearlistsusesequentialstoragewhichmustoccupyacontinuousmemoryunits.B、線(xiàn)性表采用順序存儲(chǔ)，便于進(jìn)行插入和刪除操作。Linearlistsusingsequentialstorage,itiseasytodoinsertanddeleteoperations.C、線(xiàn)性表采用鏈接存儲(chǔ)，不必占用一片連續(xù)的存儲(chǔ)單元。Linearlistsusingthelinkedstorage,donotoccupyacontinuousmemoryunits.D、線(xiàn)性表采用鏈接存儲(chǔ)，便于插入和刪除操作。Linearlistsusingthelinkedstorage,itiseasyforinsertanddeletingoperations.正確答案:【線(xiàn)性表采用順序存儲(chǔ)，必須占用一片連續(xù)的存儲(chǔ)單元。Linearlistsusesequentialstoragewhichmustoccupyacontinuousmemoryunits.#線(xiàn)性表采用鏈接存儲(chǔ)，不必占用一片連續(xù)的存儲(chǔ)單元。Linearlistsusingthelinkedstorage,donotoccupyacontinuousmemoryunits.#線(xiàn)性表采用鏈接存儲(chǔ)，便于插入和刪除操作。Linearlistsusingthelinkedstorage,itiseasyforinsertanddeletingoperations.】2、問(wèn)題：下面的敘述中正確的是：Selecttheanswerthatmatches（Therearemorethanonecorrectanswers）選項(xiàng)：A、線(xiàn)性表在鏈?zhǔn)酱鎯?chǔ)時(shí)，查找第i個(gè)元素的時(shí)間與i的數(shù)值無(wú)關(guān)。Whenthelinearliststoredinlinkedform,thetimetofindthei-thelementisregardlessofthevalueofi.B、線(xiàn)性表在順序存儲(chǔ)時(shí)，查找第i個(gè)元素的時(shí)間與i的數(shù)值成正比。Whenthelinearliststoredsequentially,thetimetofindthei-thelementisproportionaltovaluewithi.C、線(xiàn)性表在順序存儲(chǔ)時(shí)，查找第i個(gè)元素的時(shí)間與i的數(shù)值無(wú)關(guān)。Whenthelinearliststoredsequentially,thetimetofindthei-thelementisregardlessofthevalueofi.D、線(xiàn)性表在鏈?zhǔn)酱鎯?chǔ)時(shí)，插入第i個(gè)元素的時(shí)間與i的數(shù)值成正比。Whenlinearlistsstoredinthelinkedform,thetimetoinsertthei-thelementisproportionaltovaluewithi.正確答案:【線(xiàn)性表在順序存儲(chǔ)時(shí)，查找第i個(gè)元素的時(shí)間與i的數(shù)值無(wú)關(guān)。Whenthelinearliststoredsequentially,thetimetofindthei-thelementisregardlessofthevalueofi.#線(xiàn)性表在鏈?zhǔn)酱鎯?chǔ)時(shí)，插入第i個(gè)元素的時(shí)間與i的數(shù)值成正比。Whenlinearlistsstoredinthelinkedform,thetimetoinsertthei-thelementisproportionaltovaluewithi.】3、問(wèn)題：完成在雙循環(huán)鏈表結(jié)點(diǎn)p之后插入s的操作為：Theoperationtoinsertsafterthedoublycircularlinkedlist’snodepis:(Therearemorethanoneanswers.)選項(xiàng)：A、p-next-prev=s;s-prev=p;s-next=p-next;p-next=s;B、p-next-prev=s;p-next=s;s-prev=p;s-next=p-next;C、s-prev=p;s-next=p-next;p-next=s;p-next-prev=s;D、s-next=p-next;p-next-prev=s;s-prev=p;p-next=s;正確答案:【p-next-prev=s;s-prev=p;s-next=p-next;p-next=s;#s-next=p-next;p-next-prev=s;s-prev=p;p-next=s;】4、填空題：對(duì)于一個(gè)具有n個(gè)結(jié)點(diǎn)的單鏈表，在已知的結(jié)點(diǎn)*p后插入一個(gè)新結(jié)點(diǎn)的時(shí)間復(fù)雜度為O(___),在給定值為x的結(jié)點(diǎn)后插入一個(gè)新結(jié)點(diǎn)的時(shí)間復(fù)雜度為O(___)。（請(qǐng)依次填入,格式為(a)(b),如果您的答案中出現(xiàn)字母，請(qǐng)使用小寫(xiě);后一空系統(tǒng)基于字符匹配來(lái)判定答案，所以您的答案中不要出現(xiàn)空格）Forasinglelinkedlistwithnnodes,andafteraknownnode*ptoinsertanewnode,thetimecomplexityisO(___);afteragivennodewithxvalueinsertanewnode,thetimecomplexityisO(___).(Ifyouranswercontainsletters,uselowercaseone.Thesecondblankisjudgedbystringmatching,Pleasemakesureyouranswerdon'tcontainanyblanks.)正確答案:【(1)(n)】5、填空題：設(shè)某循環(huán)鏈表長(zhǎng)度為n，并設(shè)其中一節(jié)點(diǎn)為p1，然后按照鏈表的順序?qū)⒑竺娴墓?jié)點(diǎn)依次命名為p2,p3,...,pn，那么請(qǐng)問(wèn)pn.next=____(答案為一個(gè)節(jié)點(diǎn)名，注意所有字母為小寫(xiě)且答案中不包含空格)正確答案:【p1】第三章棧與隊(duì)列測(cè)驗(yàn)1、問(wèn)題：設(shè)棧S和隊(duì)列Q的初始狀態(tài)為空，元素e1，e2，e3，e4，e5和e6依次通過(guò)棧S，一個(gè)元素出棧后即進(jìn)隊(duì)列Q，若6個(gè)元素出隊(duì)的序列是e2，e4，e3，e6，e5，e1則棧S的容量至少應(yīng)該是_____________。AssumethatthestackSandqueueQ’sinitialstateisempty,theelementse1,e2,e3,e4,e5ande6followedthroughstackS,anelementoutthestackmeansintothequeueQ.Ifthesequencethesixelementsoutofthequeueise2,e4,e3,e6,e5,e1thenstackSofcapacityshouldbeatleast_____________.（Thereisonlyonecorrectanswer）選項(xiàng)：A、2B、3C、4D、6正確答案:【3】2、問(wèn)題：現(xiàn)有中綴表達(dá)式E=((100-4)/3+3*(36-7))*2。以下哪個(gè)是與E等價(jià)的后綴表達(dá)式？ExistinginfixexpressionE=((100-4)/3+3*(36-7))*2.WhichofthefollowingistheequivalentpostfixexpressionofE?（Thereisonlyonecorrectanswer）選項(xiàng)：A、((1004–)3/3(367–)*+)2*B、*+/–10043*3–3672C、1004–3/3367–*+2*D、*(+/(–1004)3*3(–367))2正確答案:【1004–3/3367–*+2*】3、問(wèn)題：隊(duì)列的特點(diǎn)包括：Queue’featuresinclude:（Therearemorethanoneanswers.）選項(xiàng)：A、后進(jìn)先出Last-infirst-out(LIFO)B、先進(jìn)后出First-inlast-out(FILO)C、先進(jìn)先出First-infirst-out(FIFO)D、后進(jìn)后出Last-inlast-out(LILO)正確答案:【先進(jìn)先出First-infirst-out(FIFO)#后進(jìn)后出Last-inlast-out(LILO)】4、問(wèn)題：以下循環(huán)隊(duì)列的實(shí)現(xiàn)方式中，長(zhǎng)度為n的隊(duì)列，所能容納的元素個(gè)數(shù)也為n的有:Inthefollowingrealizingwaysofcircularqueue,thequeuewhoselengthisncanalsocontainthenumberofnelementsis:（Therearemorethanoneanswers.）選項(xiàng)：A、只用front和rear兩個(gè)指針標(biāo)記隊(duì)列的頭和尾，兩個(gè)指針均為實(shí)指Onlyusefrontandrearasthequeue’sheadandtailpointersandthetwopointersareactuallyreferringto.B、用front和rear兩個(gè)指針標(biāo)記隊(duì)列的頭和尾，并用整型變量len記錄隊(duì)列元素?cái)?shù)Withthequeue’sheadandtailpointersmarkedasfrontandrear,usetheintegervariablelentorecordthenumberofelements.C、用front和rear兩個(gè)指針標(biāo)記隊(duì)列的頭和尾，并用布爾型變量empty記錄隊(duì)列是否為空Withthequeue’sheadandtailpointersmarkedasfrontandrear,useBooleanvariableemptyrecordwhetherthequeueisempty.D、只用front和rear兩個(gè)指針標(biāo)記隊(duì)列的頭和尾，兩個(gè)指針均為虛指Onlyusefrontandrearasthequeue’sheadandtailpointersandthetwopointersarevirtuallyreferringto.正確答案:【用front和rear兩個(gè)指針標(biāo)記隊(duì)列的頭和尾，并用整型變量len記錄隊(duì)列元素?cái)?shù)Withthequeue’sheadandtailpointersmarkedasfrontandrear,usetheintegervariablelentorecordthenumberofelements.#用front和rear兩個(gè)指針標(biāo)記隊(duì)列的頭和尾，并用布爾型變量empty記錄隊(duì)列是否為空Withthequeue’sheadandtailpointersmarkedasfrontandrear,useBooleanvariableemptyrecordwhetherthequeueisempty.】5、填空題：編號(hào)為1，2，3，4的四輛列車(chē)，順序開(kāi)進(jìn)一個(gè)棧式結(jié)構(gòu)的站臺(tái)；則開(kāi)出車(chē)站的順序有______種可能。注釋?zhuān)豪?,2,3,4或4,3,2，1就是其中兩種可能出站序列；而4,3,1,2是非法序列。Numbered1,2,3,4fourtrains,orderlyenteredastackstructurestation.Howmanypossibleleavingsequencesofthatfourtrains?______.Note:Forinstance,theleavingsequencecouldbe1,2,3,4or4,3,2,1thesetwopossibilities,but4,3,1,2isnotapossiblesequence.正確答案:【14】6、填空題：雙端隊(duì)列可以在隊(duì)列的兩端進(jìn)行插入和刪除操作，既可在隊(duì)尾進(jìn)行插入/刪除，又可在隊(duì)頭進(jìn)行插入/刪除?，F(xiàn)有4個(gè)不同的元素順序輸入到雙端隊(duì)列，那么可以得到_____種不同的排列。double-endedqueuecaninsertanddeleteoperationsonbothendsofthequeue.Thatitcaninsert/deleteatitstail,butalsoatthehead.Existing4differentelementssequentiallyinputtothedouble-endedqueue,youcanget_____differentpermutations.正確答案:【8】第四章字符串測(cè)驗(yàn)1、問(wèn)題：設(shè)有兩個(gè)串p和q，其中q是p的子串，求q在p中首次出現(xiàn)的位置的算法稱(chēng)為()（單選）Therearetwostringspq,qisp’ssubstring.Thealgorithmtosearchthefirsttimeqappearedinpiscalled()（Thereisonlyonecorrectanswer）選項(xiàng)：A、求子串SeekingsubstringB、聯(lián)接ConcatenationC、匹配MatchingD、求串長(zhǎng)Seekinglength正確答案:【匹配Matching】2、問(wèn)題：下列說(shuō)法正確的是：（單選）Whichofthefollowingstatementsiscorrect?（Thereisonlyonecorrectanswer）選項(xiàng)：A、空串就是空白串“Emptystring”isblankstring.B、空串是任意字符串的子串Emptystringisasubstringofarbitrarystring.C、串只可以采用順序存儲(chǔ)，不可以采用鏈?zhǔn)酱鎯?chǔ)Stringonlycanbestoredinsequentialmethodandcannotbestoredinlinkedmethod.D、在C++標(biāo)準(zhǔn)中，charS[M]最多能表示長(zhǎng)度為M的字符串InC++standards,charS[M]canrepresentuptoastringoflengthM.正確答案:【空串是任意字符串的子串Emptystringisasubstringofarbitrarystring.】3、問(wèn)題：若串S1=‘ABCDEFG’,S2=‘9898’,S3=‘###’,S4=‘012345’,執(zhí)行concat(replace(S1,substr(S1,length(S2),length(S3)),S3),substr(S4,index(S2,‘8’),length(S2)))注意：substr(S,i,j)是對(duì)字符串S的下標(biāo)為i開(kāi)始取j個(gè)字符，這里的下標(biāo)是從0開(kāi)始的(單選)IfthestringS1='ABCDEFG',S2='9898',S3='###',S4='012345',executeconcat(replace(S1,substr(S1,length(S2),length(S3)),S3),substr(S4,index(S2,'8'),length(S2)))Notesubstr(S,i,j)istheoperationtotakestringS’sjcharactersfromsubscripti.Subscripthereisstartingfrom0.（Thereisonlyonecorrectanswer）選項(xiàng)：A、ABCD、G0123E、ABCDH、2345I、ABCDL、1234M、ABCP、G2345正確答案:【ABCD###1234】4、問(wèn)題：下面關(guān)于串的的敘述中，哪一個(gè)是不正確的:（單選）Whichofthefollowingdescriptionsaboutstringisnotcorrect?（Thereisonlyonecorrectanswer）選項(xiàng)：A、串是字符的有限序列Stringisafinitesequenceofcharacters.B、模式匹配是串的一種重要運(yùn)算Patternmatchingisanimportantoperation.C、串是一種數(shù)據(jù)對(duì)象和操作都特殊的線(xiàn)性表StringisalinearlistwhosedataobjectsandoperationsbothspecialD、空串是由空格構(gòu)成的串Emptystringisastringconsistingofspaces.正確答案:【空串是由空格構(gòu)成的串Emptystringisastringconsistingofspaces.】5、問(wèn)題：SeekthestringBAAABBBAA‘sfeaturevector,wherethefeaturevectorisdefinedasfollows:（Thereisonlyonecorrectanswer）選項(xiàng)：A、{-1,0,0,0,0,0,0,1,2}B、{-1,0,0,0,0,1,1,1,2}C、{-1,0,0,0,0,0,1,1,2}D、{-1,0,0,0,1,1,1,1,2}正確答案:【{-1,0,0,0,0,1,1,1,2}】6、問(wèn)題：在字符{A,C,G,T}組成的DNA序列中，A和T、C和G是互補(bǔ)對(duì)。判斷一個(gè)DNA序列中是否存在互補(bǔ)回文串（例如，ATCATGAT的補(bǔ)串是TAGTACTA，與原串形成互補(bǔ)回文串）。下面DNA序列中存在互補(bǔ)回文串的是：（多選）IntheDNAsequencesconsistingofcharacter{A,C,G,T},AandT,CandGarecomplementarypairs.JudgingwhetherthereisacomplementarypalindromesequenceinaDNAsequence(e.g.,ATCATGAT’scomplementstringsisTAGTACTA,itiscomplementarypalindromesequencewiththeoriginalsequence).WhichofthefollowingDNAsequenceshavecomplementarypalindromestring?（Therearemorethanoneanswers.）選項(xiàng)：A、CTGATCAGB、AATTAATTC、TGCAACGTD、CATGGTACE、GTACGTACF、AGCTAGCT正確答案:【CTGATCAG#AATTAATT#GTACGTAC#AGCTAGCT】7、填空題：若字符串s=“software”，則其子串個(gè)數(shù)為：Ifthestrings=software,thenthenumberofitssub-stringis:正確答案:【37】8、填空題：若字符串s=”algorithm”，則其子串個(gè)數(shù)為：Ifthestrings=algorithm,thenthenumberofitssub-stringis:正確答案:【46】9、填空題：設(shè)有字符串變量StringA＝“”，B＝“MULE”，C＝“OLD”，D＝“MY”;請(qǐng)計(jì)算下列表達(dá)式（3個(gè)答案本身不要出現(xiàn)空格，答案之間用空格分開(kāi)）AssumethatthereisastringvariableStringA=,B=MULE,C=OLD,D=MY;Pleasecalculatethefollowingexpression:(1)D+C+B(2)B.substr(3，2)(3)A.strlength()正確答案:【MYOLDMULEE0】10、填空題：一個(gè)文本串可用事先給定的字母映射表進(jìn)行加密。例如，設(shè)字母映射表為：Atextstringcanbeencryptedbythegivenlettersmappingtable.Forexample,thelettersmappingtableis:正確答案:【31】第五章二叉樹(shù)前半部分（5.1~5.4）測(cè)驗(yàn)1、問(wèn)題：下列關(guān)于二叉樹(shù)性質(zhì)的說(shuō)法正確的有：（多選）Whichsentencesofthefollowingsarerightaboutabinarytree'scharacterization:（Therearemorethanonecorrectanswers）選項(xiàng)：A、非空滿(mǎn)二叉樹(shù)的結(jié)點(diǎn)個(gè)數(shù)一定為奇數(shù)個(gè)。Theamountofnodesofafullbinarytreewithatleastonenodemustbeodd.B、非完全二叉樹(shù)也可以用像完全二叉樹(shù)那樣使用順序存儲(chǔ)結(jié)構(gòu)進(jìn)行存儲(chǔ)。Sequentialstoringstructurecanalsobeusedtostoreanincompletebinarytreejustliketostoreacompletebinarytree.C、當(dāng)一棵完全二叉樹(shù)是滿(mǎn)二叉樹(shù)時(shí)，葉子結(jié)點(diǎn)不一定集中在最下面一層。Ifacompletebinarytreeisafullbinarytree,itwillbepossiblethatleafnodesisnotonthenethermostlayer.D、完全二叉樹(shù)最多只有最下面的一層結(jié)點(diǎn)度數(shù)可以小于2。Foracompletebinarytree,onlythedegreesofnodesonthenethermostlayercouldbelessthan2.E、一棵非空二叉樹(shù)的為空的外部結(jié)點(diǎn)數(shù)目等于其結(jié)點(diǎn)數(shù)加1。Theamountofexternalnullnodesinabinarytreewithatleastonenodeequalstoitsamountofnodesplus1.F、滿(mǎn)二叉樹(shù)的所有結(jié)點(diǎn)的度均為2。Alldegreesofnodesinafullbinarytreeare2.正確答案:【非空滿(mǎn)二叉樹(shù)的結(jié)點(diǎn)個(gè)數(shù)一定為奇數(shù)個(gè)。Theamountofnodesofafullbinarytreewithatleastonenodemustbeodd.#當(dāng)一棵完全二叉樹(shù)是滿(mǎn)二叉樹(shù)時(shí)，葉子結(jié)點(diǎn)不一定集中在最下面一層。Ifacompletebinarytreeisafullbinarytree,itwillbepossiblethatleafnodesisnotonthenethermostlayer.#一棵非空二叉樹(shù)的為空的外部結(jié)點(diǎn)數(shù)目等于其結(jié)點(diǎn)數(shù)加1。Theamountofexternalnullnodesinabinarytreewithatleastonenodeequalstoitsamountofnodesplus1.】2、問(wèn)題：下列關(guān)于二叉樹(shù)遍歷的說(shuō)法正確的有:Whichsentencesofthefollowingsarerightabouttraversalofabinarytree:選項(xiàng)：A、前序和中序遍歷的順序恰好一樣的二叉樹(shù)，只能是空二叉樹(shù)或者獨(dú)根二叉樹(shù)這兩種情況。Onlythesequencesofpreorderandinfixorderofthebinarytreewithnonodesoronlyonenodearethesame.B、所有結(jié)點(diǎn)左子樹(shù)為空的二叉樹(shù)的前序和中序遍歷順序恰好一樣。Thesequencesofpreorderandinfixorderofabinarytreewithallnodeswithoutleftchildtreearethesame.C、所有結(jié)點(diǎn)右子樹(shù)為空的二叉樹(shù)的前序和中序遍歷順序恰好一樣。Thesequencesofpreorderandinfixorderofabinarytreewithallnodeswithoutrightchildtreearethesame.D、只有空二叉樹(shù)和一個(gè)根結(jié)點(diǎn)的二叉樹(shù)這兩種二叉樹(shù)的前序和后序遍歷的順序恰好一樣。Onlythesequencesofpreorderandpostorderofthebinarytreewithnonodesoronlyonenodearethesame.E、所有結(jié)點(diǎn)左子樹(shù)為空的二叉樹(shù)的前序和后序遍歷順序恰好一樣。Thesequencesofpreorderandpostorderofabinarytreewithallnodeswithoutleftchildtreearethesame.F、所有結(jié)點(diǎn)右子樹(shù)為空的二叉樹(shù)的前序和后序遍歷順序恰好一樣。Thesequencesofpreorderandpostorderofabinarytreewithallnodeswithoutleftchildtreearethesame.G、只有空二叉樹(shù)和一個(gè)根結(jié)點(diǎn)的二叉樹(shù)這兩種二叉樹(shù)的中序和后序遍歷的順序恰好一樣。Onlythesequencesofinfixorderandpostorderofthebinarytreewithnonodesoronlyonenodearethesame.H、所有結(jié)點(diǎn)左子樹(shù)為空的二叉樹(shù)的中序和后序遍歷順序恰好一樣。Thesequencesofinfixorderandpostorderofabinarytreewithallnodeswithoutleftchildtreearethesame.I、所有結(jié)點(diǎn)右子樹(shù)為空的二叉樹(shù)的中序和后序遍歷順序恰好一樣。Thesequencesofinfixorderandpostorderofabinarytreewithallnodeswithoutrightchildtreearethesame.J、存在一棵非空二叉樹(shù)，它的前序、中序和后序遍歷都是一樣的。Thereexistsabinarytreewithatleastonenode,whosepreorder,infixorderandpostorderareallthesame.正確答案:【所有結(jié)點(diǎn)左子樹(shù)為空的二叉樹(shù)的前序和中序遍歷順序恰好一樣。Thesequencesofpreorderandinfixorderofabinarytreewithallnodeswithoutleftchildtreearethesame.#只有空二叉樹(shù)和一個(gè)根結(jié)點(diǎn)的二叉樹(shù)這兩種二叉樹(shù)的前序和后序遍歷的順序恰好一樣。Onlythesequencesofpreorderandpostorderofthebinarytreewithnonodesoronlyonenodearethesame.#所有結(jié)點(diǎn)右子樹(shù)為空的二叉樹(shù)的中序和后序遍歷順序恰好一樣。Thesequencesofinfixorderandpostorderofabinarytreewithallnodeswithoutrightchildtreearethesame.#存在一棵非空二叉樹(shù)，它的前序、中序和后序遍歷都是一樣的。Thereexistsabinarytreewithatleastonenode,whosepreorder,infixorderandpostorderareallthesame.】3、填空題：一棵有510個(gè)結(jié)點(diǎn)的完全二叉樹(shù)的高度為多少？（獨(dú)根樹(shù)高度為1)Whatistheheightofacompletebinarytreewith510nodes?(theheightofatreewithonlyarootis1)正確答案:【9】4、填空題：一棵有512個(gè)結(jié)點(diǎn)的完全二叉樹(shù)的高度為多少？（獨(dú)根樹(shù)高度為1）Whatistheheightofacompletebinarytreewith512nodes?(theheightofatreewithonlyarootis1)正確答案:【10】5、填空題：在一棵非空二叉樹(shù)中，若度為0的結(jié)點(diǎn)的個(gè)數(shù)n，度為2的結(jié)點(diǎn)個(gè)數(shù)為m，則有n=________(系統(tǒng)根據(jù)字符串匹配來(lái)判定答案，所以您的答案中請(qǐng)不要包含空格)Forabinarytreewithatleastonenode,iftherearennodeswithdegree0andmnodeswithdegree2,thenn=________（Thisproblemisjudgedbystringmatching,Pleasemakesureyouranswerdon'tcontainanyblanks.）正確答案:【m+1】6、填空題：已知一棵樹(shù)的前序遍歷為ABDEGCF，中序遍歷為DBGEACF，求這棵樹(shù)的后序遍歷。（字母和字母之間不要有空格）ThepreordersequenceofatreeisABDEGCF,anditsinfixordersequenceisDBGEACF,pleasewritedownitspostordersequence.(Thereisnoblankspacebetweenletters)正確答案:【DGEBFCA】7、填空題：已知一棵樹(shù)的中序遍歷為DBGEACF，后序遍歷為DGEBFCA，求這棵樹(shù)的前序遍歷。（字母和字母之間不要有空格）TheinfixordersequenceofatreeisDBGEACF,anditspostordersequenceisDGEBFCA,pleasewritedownitspreordersequence.(Thereisnoblankspacebetweenletters)正確答案:【ABDEGCF】8、填空題：請(qǐng)寫(xiě)出下面這棵二叉樹(shù)的前序遍歷（字母和字母之間不要有空格）Pleasewritedownthepreordersequenceofthefollowingbinarytree.(Thereisnoblankspacebetweenletters)正確答案:【BEXLMKCPDHQA】9、填空題：請(qǐng)寫(xiě)出下面這棵二叉樹(shù)的中序遍歷（字母和字母之間不要有空格）Pleasewritedowntheinfixordersequenceofthefollowingbinarytree.(Thereisnoblankspacebetweenletters)正確答案:【LXMECKPBQHDA】10、填空題：請(qǐng)寫(xiě)出下面這棵二叉樹(shù)的后序遍歷（字母和字母之間不要有空格）Pleasewritedownthepostordersequenceofthefollowingbinarytree.(Thereisnoblankspacebetweenletters)正確答案:【LMXCPKEQHADB】第五章二叉樹(shù)后半部分（5.5~5.7）測(cè)驗(yàn)1、問(wèn)題：下列關(guān)于二叉搜索樹(shù)的說(shuō)法正確的有Whichsentencesofthefollowingsarerightaboutbinarysearchtree:選項(xiàng)：A、二叉搜索樹(shù)按照中序遍歷將各結(jié)點(diǎn)打印出將各結(jié)點(diǎn)打印出來(lái)，將得到按照由小到大的排列。Ifweprintabinarysearchtree'snodesaccordingitsinfixorder,thesequencewillbefromsmalltolarge.B、如果結(jié)點(diǎn)χ的左子樹(shù)有右子樹(shù)，則存在某個(gè)結(jié)點(diǎn)的值介于結(jié)點(diǎn)χ的值和χ左兒子的值之間，并且這個(gè)結(jié)點(diǎn)在$$x$$的左子樹(shù)之中。Iftheleftchildtreeofanodexhasarightchildtree,thenthereexistssomenodewhosevalueisbetweenthevalueofnodexandthevalueofitsleftchildnode,andthisnodeisontheleftchildtreeofnodex.C、當(dāng)根結(jié)點(diǎn)沒(méi)有左兒子時(shí)，根結(jié)點(diǎn)一定是值最小的結(jié)點(diǎn)。Iftherootnodedoesn'thaveleftchild,itmustbethenodewiththesmallestvalue.D、二叉搜索樹(shù)一定是滿(mǎn)二叉樹(shù)。Abinarysearchtreemustbeafullbinarytree.E、二叉搜索樹(shù)一定是完全二叉樹(shù)。Abinarysearchtreemustbeacompletebinarytree.F、從根結(jié)點(diǎn)一直沿右兒子向下找不一定能找到樹(shù)中值最大的結(jié)點(diǎn)。Alongtherightchildofnodesallthetimefromtherootnode,itispossiblethatwecouldn'tfindoutthenodewiththelargestvalue.正確答案:【二叉搜索樹(shù)按照中序遍歷將各結(jié)點(diǎn)打印出將各結(jié)點(diǎn)打印出來(lái)，將得到按照由小到大的排列。Ifweprintabinarysearchtree'snodesaccordingitsinfixorder,thesequencewillbefromsmalltolarge.#如果結(jié)點(diǎn)χ的左子樹(shù)有右子樹(shù)，則存在某個(gè)結(jié)點(diǎn)的值介于結(jié)點(diǎn)χ的值和χ左兒子的值之間，并且這個(gè)結(jié)點(diǎn)在$$x$$的左子樹(shù)之中。Iftheleftchildtreeofanodexhasarightchildtree,thenthereexistssomenodewhosevalueisbetweenthevalueofnodexandthevalueofitsleftchildnode,andthisnodeisontheleftchildtreeofnodex.#當(dāng)根結(jié)點(diǎn)沒(méi)有左兒子時(shí)，根結(jié)點(diǎn)一定是值最小的結(jié)點(diǎn)。Iftherootnodedoesn'thaveleftchild,itmustbethenodewiththesmallestvalue.】2、問(wèn)題：下列關(guān)于堆的說(shuō)法正確的有:Whichsentencesofthefollowingsareright:選項(xiàng)：A、堆一定是滿(mǎn)二叉樹(shù)。Aheapmustbeafullbinarytree.B、最小堆中，最下面一層最靠右的結(jié)點(diǎn)一定是權(quán)值最大的結(jié)點(diǎn)。Inaminimumheap,therightestnodeonthenethermostlayermustbethenodewiththelargestvalue.C、堆是實(shí)現(xiàn)優(yōu)先隊(duì)列的惟一方法。Aheapistheonlymethodtoimplementapriorityqueue.D、堆一定是完全二叉樹(shù)。Aheapmustbeacompletebinarytree.E、最小堆中，某個(gè)結(jié)點(diǎn)左子樹(shù)中最大的結(jié)點(diǎn)可能比右子樹(shù)中最小的結(jié)點(diǎn)小。Inaminimumheap,thelargestvalueonsomenode'sleftchildtreecouldbepossiblysmallerthanthesmallestvalueofitsrightchildtree.F、使用篩選法建堆要比將元素一個(gè)一個(gè)插入堆來(lái)建堆效率高。Screeningmethodhasahigherefficiencythaninsertingelementsonebyonewhileconstructingaheap.正確答案:【堆一定是完全二叉樹(shù)。Aheapmustbeacompletebinarytree.#最小堆中，某個(gè)結(jié)點(diǎn)左子樹(shù)中最大的結(jié)點(diǎn)可能比右子樹(shù)中最小的結(jié)點(diǎn)小。Inaminimumheap,thelargestvalueonsomenode'sleftchildtreecouldbepossiblysmallerthanthesmallestvalueofitsrightchildtree.#使用篩選法建堆要比將元素一個(gè)一個(gè)插入堆來(lái)建堆效率高。Screeningmethodhasahigherefficiencythaninsertingelementsonebyonewhileconstructingaheap.】3、問(wèn)題：下列關(guān)于Huffman樹(shù)和Huffman編碼的說(shuō)法正確的有:WhichsentencesofthefollowingsarerightaboutHuffmantreeandHuffmancode:選項(xiàng)：A、Huffman樹(shù)一定是滿(mǎn)二叉樹(shù)。AHuffmantreemustbeafullbinarytree.B、Huffman編碼是一種前綴編碼。Huffmancodeisakindofprefixcode.C、Huffman樹(shù)一定是完全二叉樹(shù)。AHuffmantreemustbeacompletebinarytree.D、Huffman編碼中所有編碼都是等長(zhǎng)的。AllcodesinaHuffmancodehavethesamelength.E、對(duì)于同樣的一組權(quán)值兩兩不同的內(nèi)容可以得到不同的Huffman編碼方案。DifferentcontentwiththesamegroupofweightscangetdifferentHuffmancodes.F、使用頻率越高的字母，Huffman編碼越長(zhǎng)。Thehigheraletter'sfrequencyis,thelongeritsHuffmancodeis.正確答案:【Huffman樹(shù)一定是滿(mǎn)二叉樹(shù)。AHuffmantreemustbeafullbinarytree.#Huffman編碼是一種前綴編碼。Huffmancodeisakindofprefixcode.#對(duì)于同樣的一組權(quán)值兩兩不同的內(nèi)容可以得到不同的Huffman編碼方案。DifferentcontentwiththesamegroupofweightscangetdifferentHuffmancodes.】4、問(wèn)題：一組包含不同權(quán)的字母已經(jīng)對(duì)應(yīng)好Huffman編碼，如果某一個(gè)字母對(duì)應(yīng)編碼001,下面說(shuō)法正確的有AgroupofletterswithdifferentweightshascorrespondedwithHuffmancodes,ifaletter'scorrespondingcodeis001,whichsentencesofthefollowingsareright:選項(xiàng)：A、以001開(kāi)頭的編碼不可能對(duì)應(yīng)其他字母。Acodebeginningwith001couldn'tcorrespondwithotherletters.B、以000開(kāi)頭的編碼不可能對(duì)應(yīng)任何字母。Codesbeginningwith000couldn'tcorrespondwithanyletter.C、以01開(kāi)頭和1開(kāi)頭的編碼肯定對(duì)應(yīng)某個(gè)字母。Codesbeginningwith01or1mustcorrespongdingwithsomeletters.D、建好的Huffman樹(shù)至少包含4個(gè)葉結(jié)點(diǎn)。TheHuffmantreecontainsatleast4leafnodes.E、編碼0和00可能對(duì)應(yīng)于其他字母。Code0and00couldcorrespondingwithotherletters.正確答案:【以001開(kāi)頭的編碼不可能對(duì)應(yīng)其他字母。Acodebeginningwith001couldn'tcorrespondwithotherletters.#以01開(kāi)頭和1開(kāi)頭的編碼肯定對(duì)應(yīng)某個(gè)字母。Codesbeginningwith01or1mustcorrespongdingwithsomeletters.#建好的Huffman樹(shù)至少包含4個(gè)葉結(jié)點(diǎn)。TheHuffmantreecontainsatleast4leafnodes.】5、填空題：如果按關(guān)鍵碼值遞增的順序依次將n個(gè)關(guān)鍵碼值插入到二叉搜索樹(shù)中，如果對(duì)這樣的二叉搜索樹(shù)進(jìn)行檢索時(shí)，每次檢索的字符都等概率的從這n個(gè)關(guān)鍵碼值中選取，平均比較次數(shù)為多少？Ifweinsertnkeyvaluestoabinarysearchtreesuccessivelyfromsmalltolarge,whenwesearchthisbinarysearchtree,eachtimethesearchcharacterisselectedfromthesenkeyvalueswiththesamepossibility,thenhowmanytimeswillthecomparisonbeonaverage?正確答案:【(n+1)/2##%_YZPRLFH_%##(1+n)/2】6、填空題：從空二叉樹(shù)開(kāi)始，嚴(yán)格按照二叉搜索樹(shù)的插入算法（不進(jìn)行旋轉(zhuǎn)平衡），逐個(gè)插入關(guān)鍵碼{18,73,10,5,68,99,27,41,51,32,25}構(gòu)造出一棵二叉搜索樹(shù)，對(duì)該二叉搜索樹(shù)按照前序遍歷得到的序列為？（答案中每?jī)蓚€(gè)元素之間用一個(gè)空格隔開(kāi)）Fromanullbinarytree,insertkeyvalues{18,73,10,5,68,99,27,41,51,32,25}successivelyaccordingtotheinsertionalgorithmofabinarysearchtreestrictly(norotationandbalance)toconstructabinarysearchtree.Pleasewritedownthesequenceofpreorderofthisbinarysearchtree.(Thereisoneblankspacebetweentwoelements)正確答案:【181057368272541325199】7、填空題：從空二叉樹(shù)開(kāi)始，嚴(yán)格按照二叉搜索樹(shù)的插入算法（不進(jìn)行旋轉(zhuǎn)平衡），逐個(gè)插入關(guān)鍵碼{18,73,10,5,68,99,27,41,51,32,25}構(gòu)造出一棵二叉搜索樹(shù)，對(duì)該二叉搜索樹(shù)按照后序遍歷得到的序列為？（答案中每?jī)蓚€(gè)元素之間用一個(gè)空格隔開(kāi)）Fromanullbinarytree,insertkeyvalues{18,73,10,5,68,99,27,41,51,32,25}successivelyaccordingtotheinsertionalgorithmofabinarysearchtreestrictly(norotationandbalance)toconstructabinarysearchtree.Pleasewritedownthesequenceofpostorderofthisbinarysearchtree.(Thereisoneblankspacebetweentwoelements)正確答案:【510253251412768997318】8、填空題：從空二叉樹(shù)開(kāi)始，嚴(yán)格按照二叉搜索樹(shù)的插入算法（不進(jìn)行旋轉(zhuǎn)平衡），逐個(gè)插入關(guān)鍵碼構(gòu)造出一棵二叉樹(shù)，以怎樣的順序插入關(guān)鍵碼集合{14，32，47，6，9，12，78，63，29，81}可以使得樹(shù)的深度最?。空?qǐng)依次寫(xiě)出插入到樹(shù)中的元素，每?jī)蓚€(gè)元素之間用一個(gè)空格隔開(kāi)。如果有多組滿(mǎn)足要求的方案，請(qǐng)使得你的答案中先插入的元素盡可能的小。Fromanullbinarytree,insertkeyvaluessuccessivelyaccordingtotheinsertionalgorithmofabinarysearchtreestrictly(norotationandbalance)toconstructabinarysearchtree.Whatistheinsertionsequencethatcouldmakethetreehaveasmallestdepthwithakeyvalueset{14，32，47，6，9，12，78，63，29，81}?Pleasewritedowntheelementssuccessively,andthereisoneblankspacebetweentwoelements.Iftherearemorethanoneanswerthatmeetthecondition,pleasemaketheelementwhichneedstobeinsertedfirstassmallaspossibleinyouranswer.正確答案:【126947291432786381】9、填空題：對(duì)于關(guān)鍵碼序列{38，64，52，15，73，40，48，55，26，12}，用篩選法建最小值堆，若一旦發(fā)現(xiàn)逆序?qū)瓦M(jìn)行交換，共需要交換元素多少次？Forthekeyvaluesequence{38，64，52，15，73，40，48，55，26，12},usethescreeningmethodtoconstuctaminimumheap,ifweexchangethemwhenwefindreversedorder,thenhowmanytimesshouldweexchangethem?正確答案:【6】10、填空題：對(duì)于如下圖所示的最大堆，刪除掉最大的元素后，堆的前序遍歷結(jié)果是Forthefollowingmaximumheap,afterdeletingthemaximumelement,thepreordertraversalsequenceis請(qǐng)依次寫(xiě)出插入到樹(shù)中的元素，每?jī)蓚€(gè)元素之間用一個(gè)空格隔開(kāi)。Pleasewritedowntheelementssuccessively,andthereisoneblankspacebetweentwoelements.正確答案:【59432412233728557483】11、填空題：對(duì)于如下圖所示的最大堆，刪除掉最大的元素后，堆的后序遍歷結(jié)果是Forthefollowingmaximumheap,afterdeletingthemaximumelement,thepostordertraversalsequenceis正確答案:【12232428537434835759】12、填空題：下表展示了在一段文本中每個(gè)字母出現(xiàn)的次數(shù)。Thefrequenciesthateachletterappearsinaparagraphisrepresentedasfollow.正確答案:【36】13、填空題：對(duì)于給定的一組權(quán)W={1,4,9,16,25,36,49,64,81,100}，構(gòu)造一棵具有最小帶權(quán)外部路徑長(zhǎng)度的三叉樹(shù)，寫(xiě)出這棵樹(shù)的帶權(quán)外部路徑長(zhǎng)度。ForagivengroupofweightsW={1,4,9,16,25,36,49,64,81,100},pleaseconstructaternarytreewithaminimumweightedroutelengthandwritedownthisweightedroutelength.正確答案:【705】14、填空題：請(qǐng)閱讀下面一段代碼PleasereadthefollowingcodeC++：正確答案:【1】15、填空題：請(qǐng)閱讀下面一段代碼PleasereadthefollowingcodeC++：正確答案:【2】16、填空題：請(qǐng)閱讀下面一段代碼PleasereadthefollowingcodeC++：正確答案:【3】第六章樹(shù)測(cè)驗(yàn)1、問(wèn)題：一個(gè)深度為h的滿(mǎn)k叉樹(shù)，最多有多少個(gè)葉結(jié)點(diǎn)？（獨(dú)根樹(shù)深度為0）(單選)Thereisafullk-arytree,whosedepthish.Howmanyleafnodescanithaveatmost?(Thedepthofatree,whichonlyhasarootnode,is0.)（Thereisonlyonecorrectanswer）選項(xiàng)：A、B、C、D、正確答案:【】2、問(wèn)題：一個(gè)深度為h的滿(mǎn)k叉樹(shù)，最多有多少個(gè)結(jié)點(diǎn)？（獨(dú)根樹(shù)深度為0）Thereisafullk-arytree,whosedepthish.Howmanynodescanithaveatmost?(Thedepthofatree,whichonlyhasarootnode,is0.)選項(xiàng)：A、B、C、D、正確答案:【】3、問(wèn)題：設(shè)F是由T1,T2,T3三棵樹(shù)組成的森林，其中T1,T2,T3的結(jié)點(diǎn)數(shù)分別為n1,n2和n3，與F對(duì)應(yīng)的二叉樹(shù)為B，則二叉樹(shù)B的右子樹(shù)中有_____________個(gè)結(jié)點(diǎn)(單選）AssumethatFisaforest,madeupoftreeT1,T2,T3,andthenodenumbersofT1,T2,T3aren1,n2,n3.LetBbethecorrespondingbinarytreeofF,thenB'srightsub-treewillhas__________nodes.(Thereisonlyonecorrectanswer)選項(xiàng)：A、n2B、n3C、n1+n3D、n2+n3正確答案:【n2+n3】4、問(wèn)題：設(shè)F是由T1,T2,T3三棵樹(shù)組成的森林，其中T1,T2,T3的結(jié)點(diǎn)數(shù)分別為n1,n2和n3，與F對(duì)應(yīng)的二叉樹(shù)為B，則二叉樹(shù)B的左子樹(shù)中有_____________個(gè)結(jié)點(diǎn)(單選）AssumethatFisaforest,madeupoftreeT1,T2,T3,andthenodenumbersofT1,T2,T3aren1,n2,n3.LetBbethecorrespondingbinarytreeofF,thenB'sleftsub-treewillhas__________nodes.(Thereisonlyonecorrectanswer)選項(xiàng)：A、n2-1B、n3-1C、n1-1D、n2正確答案:【n1-1】5、問(wèn)題：將一棵樹(shù)T轉(zhuǎn)換為左子/右兄鏈表表示的二叉樹(shù)B，則T的后根次序遍歷序列是B的相應(yīng)_________序列。（單選）TransformatreeTintoabinarytreeB,whichisrepresentedbyLeft-Child/Right-Siblingimplementation.Thenthepost-ordertraversalsequenceofTisthesameasthe__________sequenceofB.（Thereisonlyonecorrectanswer）選項(xiàng)：A、前序遍歷B、后序遍歷C、中序遍歷D、層次遍歷正確答案:【中序遍歷】6、問(wèn)題：2-3樹(shù)是一種特殊的樹(shù)，它滿(mǎn)足兩個(gè)條件：（1）每個(gè)內(nèi)部結(jié)點(diǎn)有兩個(gè)或三個(gè)子結(jié)點(diǎn)；（2）所有的葉結(jié)點(diǎn)到根的路徑長(zhǎng)度相同；如果一棵2-3樹(shù)有9個(gè)葉結(jié)點(diǎn)，那么它可能有_________個(gè)非葉結(jié)點(diǎn)。(多項(xiàng))2-3treeisaspecialkindoftree,itsatisfy:（1）Everyinternalnodehas2or3childnodes.(2)Alltheleafnodeshavethesamelengthofthepathtotherootnode.Ifa2-3treehas9leafnodes,thenitmayhave__________non-leafnodes.（Therearemorethanonecorrectanswers）選項(xiàng)：A、4B、5C、6D、7正確答案:【4#7】7、填空題：給出一棵樹(shù)的邏輯結(jié)構(gòu)T=(N,R),其中：N={A,B,C,D,E,F,G,H,I,J,K}R={r}r={(A,B),(B,E),(B,F),(F,G),(F,H),(A,C),(C,I),(C,J),(J,K),(A,D)}Givenalogicalstructureofatree,T=(N,R),andN={A,B,C,D,E,F,G,H,I,J,K},R={r},r={(A,B),(B,E),(B,F),(F,G),(F,H),(A,C),(C,I),(C,J),(J,K),(A,D)}試回答下列問(wèn)題：Pleaseanswerthesequesti