【精品数据结构】binary trees

【精品数据结构】binary trees

ID:40170927

大小:1.60 MB

页数:49页

时间:2019-07-24

【精品数据结构】binary trees_第1页
【精品数据结构】binary trees_第2页
【精品数据结构】binary trees_第3页
【精品数据结构】binary trees_第4页
【精品数据结构】binary trees_第5页
资源描述:

《【精品数据结构】binary trees》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、BinaryTreesAbinarytreeismadeupofafinitesetofnodesthatiseitheremptyorconsistsofanodecalledtheroottogetherwithtwobinarytrees,calledtheleftandrightsubtrees,whicharedisjointfromeachotherandfromtheroot.BinaryTreeExampleNotation:Node,children,edge,parent,ancestor,descendant,path,depth,height,

2、level,leafnode,internalnode,subtree.FullandCompleteBinaryTreesFullbinarytree:Eachnodeiseitheraleaforinternalnodewithexactlytwonon-emptychildren.Completebinarytree:Iftheheightofthetreeisd,thenallleavesexceptpossiblyleveldarecompletelyfull.Thebottomlevelhasallnodestotheleftside.FullBinary

3、TreeTheorem(1)Theorem:Thenumberofleavesinanon-emptyfullbinarytreeisonemorethanthenumberofinternalnodes.Proof(byMathematicalInduction):Basecase:Afullbinarytreewith1internalnodemusthavetwoleafnodes.InductionHypothesis:AssumeanyfullbinarytreeTcontainingn-1internalnodeshasnleaves.FullBinary

4、TreeTheorem(2)InductionStep:GiventreeTwithninternalnodes,pickinternalnodeIwithtwoleafchildren.RemoveI’schildren,callresultingtreeT’.Byinductionhypothesis,T’isafullbinarytreewithnleaves.RestoreI’stwochildren.Thenumberofinternalnodeshasnowgoneupby1toreachn.Thenumberofleaveshasalsogoneupby

5、1.FullBinaryTreeCorollaryTheorem:Thenumberofnullpointersinanon-emptytreeisonemorethanthenumberofnodesinthetree.Proof:Replaceallnullpointerswithapointertoanemptyleafnode.Thisisafullbinarytree.BinaryTreeNodeClass(1)//BinarytreenodeclasstemplateclassBinNodePtr:publicBinNode

6、>{private:Elemit;//Thenode'svalueBinNodePtrlc;//PointertoleftchildBinNodePtrrc;//Pointertorightchildpublic:BinNodePtr(){lc=rc=NULL;}BinNodePtr(Eleme,BinNodePtrl=NULL,BinNodePtrr=NULL){it=e;lc=l;rc=r;}BinaryTreeNodeClass(2)Elem&val(){returnit;}voidsetVal(constElem&e){it=e;}inlineBinNode<

7、Elem>left()const{returnlc;}voidsetLeft(BinNodeb){lc=(BinNodePtr)b;}inlineBinNoderight()const{returnrc;}voidsetRight(BinNodeb){rc=(BinNodePtr)b;}boolisLeaf(){return(lc==NULL)&&(rc==NULL);}};Traversals(1)Anyprocessforvisitingthenodesinsomeorderiscalledatraversal

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

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

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