Data Structures with C++ using STL 2E Chapter 10

《Data Structures with C++ using STL 2E Chapter 10》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、1MainIndexContentsTreeStructures(3slides)TreeNodeLevelandPathLen.(5slides)BinaryTreeDefinitionSelectedSamples/BinaryTreesBinaryTreeNodesBinarySearchTreesLocatingDatainaTreeRemovingaBinaryTreeNodestreeADT(4slides)UsingBinarySearchTrees-RemovingDuplicatesUpdateOperations(3slides)Removinga

2、nItemFromaBinaryTree(7slides)Chapter10–BinaryTreesSummarySlides(5slides)12MainIndexContentsTreeStructures23MainIndexContentsTreeStructures34MainIndexContentsTreeStructures45MainIndexContentsTreeNodeLevelandPathLength56MainIndexContentsTreeNodeLevelandPathLength–DepthDiscussion67MainInde

3、xContentsTreeNodeLevelandPathLength–DepthDiscussion78MainIndexContentsTreeNodeLevelandPathLength–DepthDiscussion89MainIndexContentsTreeNodeLevelandPathLength–DepthDiscussion9BinaryTreeDefinitionAbinarytreeTisafinitesetofnodeswithoneofthefollowingproperties:(a)Tisatreeifthesetofnodesisem

4、pty.(Anemptytreeisatree.)(b)Thesetconsistsofaroot,R,andexactlytwodistinctbinarytrees,theleftsubtreeTLandtherightsubtreeTR.ThenodesinTconsistofnodeRandallthenodesinTLandTR.1011MainIndexContentsSelectedSamplesofBinaryTrees1112MainIndexContentsBinaryTreeNodes1213MainIndexContentsBinarySear

5、chTrees1314MainIndexContentsCurrentNodeAction-LOCATINGDATAINATREE-Root=50Compareitem=37and5037<50,movetotheleftsubtreeNode=30Compareitem=37and3037>30,movetotherightsubtreeNode=35Compareitem=37and3537>35,movetotherightsubtreeNode=37Compareitem=37and37.Itemfound.1415MainIndexContentsRemov

6、ingaBinarySearchTreeNode1516MainIndexContentsCLASSstreeConstructors“d_stree.h”stree();Createanemptysearchtree.stree(T*first,T*last);Createasearchtreewiththeelementsfromthepointerrange[first,last).CLASSstreeOpertions“d_stree.h”voiddisplayTree(intmaxCharacters);Displaythesearchtree.Themax

7、imumnumberofcharactersneededtooutputanodevalueismaxCharacters.boolempty();Returntrueifthetreeisemptyandfalseotherwise.1617MainIndexContentsCLASSstreeOpertions“d_stree.h”interase(constT&item);Searchthetreeandremoveitem,ifitispresent;otherwise,takenoaction.Returnthenumberofelemen