目标加速搜索随工具二进制树根大小问题尽管高度但可能一样糟糕splay treeavl张开.pptx

§4AVLTreesTarget:Speedupsearching(withinsertionanddeletion)Tool:BinarysearchtreesrootsmalllargeProblem:AlthoughTp=O(height),buttheheightcanbeasbadasΩ(N)CHAPTER4Trees1/18

§4AVLTrees〖Example〗2binarysearchtreesobtainedforthemonthsoftheyearNovOctSeptMayMarJuneJulyDecAugAprFebJanJulyJuneMarMayOctSeptNovJanFebAugAprDecEnteredfromJantoDecAbalancedtree2/18Averagesearchtime=3.5Averagesearchtime=3.1Averagesearchtimeoftheskewtree=6.5

§4AVLTreesAdelson-Velskii-Landis(AVL)Trees(1962)【Definition】Anemptybinarytreeisheightbalanced.IfTisanonemptybinarytreewithTLandTRasitsleftandrightsubtrees,thenTisheightbalancediff(1)TLandTRareheightbalanced,and(2)|hL?hR|?1wherehLandhRaretheheightsofTLandTR,respectively.【Definition】ThebalancefactorBF(node)=hL?hR.InanAVLtree,BF(node)=?1,0,or1.582143778214354563217Theheightofanemptytreeisdefinedtobe–1.3/18

§4AVLTrees〖Example〗InputthemonthsMarMar0?1MayMay0NovNov0?1?2May0?1Nov00?2?1Mar000?ThetroublemakerNovisintherightsubtree’srightsubtreeofthetroublefinderMar.HenceitiscalledanRRrotation.Ingeneral:A?1B0BLBRALRRInsertionRRRotationA?2B?1BLBRALBLB0AALBR0AisnotnecessarilytherootofthetreeSinglerotation4/18

§4AVLTreesAugMay0?1Nov00?2?1Mar011Aug0AprApr01225/18Discussion1:Whatcanwedonow?

§4AVLTreesMay0?1Nov00?2?1Aug011?1Mar00Apr0JanJan01?12LRRotationMar0?1May0?1?2?1Aug010?1Jan00Apr0Nov0Ingeneral:A1B0BLARC0CRCLLRInsertionA2B?1BLARC?1CRCLORLRRotationBLARC0A?1or0CRB0or1CLORDoubleRotation6/18

§4AVLTreesDecJulyMar0?1May0?1?2?1Aug011?1Jan0Apr0Nov0July0Dec0FebFeb0?11?22RLRotationJuly0Dec0?1Aug01?2?1Jan010?1Feb00Apr0Mar0?1May0?1?2?11Nov0Ingeneral:A1B0BRALC0CLCRRLInsertionA?2B1BRALC?1CLCRORRLRotationBRALC0A0or1CLB?1or0CROR7/18

§4AVLTreesJuly0Dec0?1Aug01?2?1Jan010?1Feb00Apr0Mar0?1May0?1?2?11Nov0JuneOctSeptJune0?