关于红黑树(Red-Black Tree)英文简介

关于红黑树(Red-Black Tree)英文简介

ID:39552491

大小:278.50 KB

页数:17页

时间:2019-07-06

关于红黑树(Red-Black Tree)英文简介_第1页
关于红黑树(Red-Black Tree)英文简介_第2页
关于红黑树(Red-Black Tree)英文简介_第3页
关于红黑树(Red-Black Tree)英文简介_第4页
关于红黑树(Red-Black Tree)英文简介_第5页
资源描述:

《关于红黑树(Red-Black Tree)英文简介》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、Red-BlackTreeRed-blackTreeTypeTreeInvented1972InventedbyRudolfBayerTimecomplexityinbigOnotationAverageWorstcaseSpaceO(n)O(n)SearchO(logn)O(logn)InsertO(logn)O(logn)DeleteO(logn)O(logn)Ared-blacktreeisatypeofself-balancingbinarysearchtree,adatastructureusedincomputingscience,typic

2、allyusedtoimplementassociativearrays.Theoriginalstructurewasinventedin1972byRudolfBayerwhocalledthem"symmetricbinaryB-trees",butacquireditsmodernnameinapaperin1978byLeonidasJ.GuibasandRobertSedgewick.Itiscomplex,buthasgoodworst-caserunningtimeforitsoperationsandisefficientinpract

3、ice:itcansearch,insert,anddeleteinO(logn)time,wherenistotalnumberofelementsinthetree.Putverysimply,ared-blacktreeisabinarysearchtreewhichinsertsandremovesintelligently,toensurethetreeisreasonablybalanced.TerminologyAred-blacktreeisaspecialtypeofbinarytree,usedincomputersciencetoo

4、rganizepiecesofcomparabledata,suchastextfragmentsornumbers.Theleafnodesofred-blacktreesdonotcontaindata.Theseleavesneednotbeexplicitincomputermemory—anullchildpointercanencodethefactthatthischildisaleaf—butitsimplifiessomealgorithmsforoperatingonred-blacktreesiftheleavesreallyare

5、explicitnodes.Tosavememory,sometimesasinglesentinelnodeperformstheroleofallleafnodes;allreferencesfrominternalnodestoleafnodesthenpointtothesentinelnode.Red-blacktrees,likeallbinarysearchtrees,allowefficientin-ordertraversalinthefashion,Left-Root-Right,oftheirelements.Thesearch-t

6、imeresultsfromthetraversalfromroottoleaf,andthereforeabalancedtree,havingtheleastpossibletreeheight,resultsinO(logn)searchtime.PropertiesAnexampleofared-blacktreeAred-blacktreeisabinarysearchtreewhereeachnodehasacolorattribute,thevalueofwhichiseitherredorblack.Inadditiontotheordi

7、naryrequirementsimposedonbinarysearchtrees,thefollowingadditionalrequirementsapplytored-blacktrees:1.Anodeiseitherredorblack.2.Therootisblack.(Thisruleisusedinsomedefinitionsandnotothers.Sincetherootcanalwaysbechangedfromredtoblackbutnotnecessarilyvice-versathisrulehaslittleeffec

8、tonanalysis.)3.Allleavesareblack.4.Bothc

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。