程序设计与算法基础课件.ppt

程序设计与算法基础课件.ppt

ID:56947388

大小:863.50 KB

页数:107页

时间:2020-07-21

程序设计与算法基础课件.ppt_第1页
程序设计与算法基础课件.ppt_第2页
程序设计与算法基础课件.ppt_第3页
程序设计与算法基础课件.ppt_第4页
程序设计与算法基础课件.ppt_第5页
资源描述:

《程序设计与算法基础课件.ppt》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、程序设计与算法基础(4)潘爱民2006/10/16OutlinetreetreeBinarysearchtreeTreetraversalInsertioninabinarytreeDeletinginabinarytreeBalancingatreeSplaytreeHeaptreesThetreeinrealworldleavesrootbranchesThetreeincomputersciencerootleavesarcsnodesHierarchicalstructuresinrea

2、lworldCorporationorganizationUniversityorganizationMaildispatchingInternetThedatastructuresThelineardatastructureArrayLinkedlistInessence,stackandqueueoperateonalinearstructureTreeisanon-lineardatastructureAformaldefinitionoftreeAtreeconsistsofnodesa

3、ndarcs1.Anemptystructureisanemptytree2.Ift1,…,tk,aredisjointtrees,thenthestructurewhoseroothasasitschildrentherootsoft1,...,tkisalsoatree.3.Onlystructuresgeneratedbyrules1and2aretrees.ExamplesoftreesThetermsinatreeRoot:thetopelementifnotanemptytreeCh

4、ildren,parentGrandparent,siblings,…Path(foranode):auniquesequenceofarcsfromroottoanodeLength(forapath):thenumberofarcsinapathLevel(foranode):thelengthofthepathfromtheroottothenodeplus1,i.e.thenumberofnodesinthepathHeight(foratree):themaximumlevelofan

5、odeinthetreeFortheemptytree,theheightis0Forthetreewithasinglenode,theheightis1levelsLevel4Level3Level2PresidentVP1VP2VP3Manager1Manager2ManagerManagerWorkerBeeLevel1NotesaboutlevelsSometextsstartlevelnumbersat0ratherthanat1Rootisatlevel1.Itschildrena

6、reatlevel2.Thegrandchildrenoftherootareatlevel3.Andsoon.height=depth=numberoflevelsNodeDegree =NumberOfChildrenPresidentVP1VP2VP3Manager1Manager2ManagerManagerWorkerBee321100100TreeDegree =MaxNodeDegreeDegreeoftree=3.PresidentVP1VP2VP3Manager1Manager

7、2ManagerManagerWorkerBee321100100AbinarytreeDefinitionAbinarytreeisatreewhosenodeshaveatmosttwochildren(possiblyempty)AndeachchildisdesignedaseitheraleftchildorarightchildPropertiesofabinarytreeMinimumnumberofnodesinabinarytreewhoseheightishishMaximu

8、mnumberofnodesinabinarytreewhoseheightishis2h-1Ifnisthenumberofnodesinabinarytreewhoseheightish,thenh<=n<=2h–1AcompletebinarytreeSatisfyingthecondition:AllthenodesatalllevelsexceptthelasthavetwochildrenFeaturesAllnon-terminalnodeshaveboththeirchildre

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

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

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