计算机科学概论原版(第九版)-8市公开课一等奖省赛课微课金奖课件.pptx

Chapter8DataAbstractions?PearsonAddison-Wesley.Allrightsreserved第1页

Chapter8:DataAbstractions8.1DataStructureFundamentals8.2ImplementingDataStructures8.3AShortCaseStudy8.4CustomizedDataTypes8.5ClassesandObjects8.6PointersinMachineLanguage第2页

BasicDataStructuresHomogeneousarrayHeterogeneousarrayListStackQueueTree第3页

Figure8.1Lists,stacks,andqueues第4页

TerminologyforListsList:AcollectionofdatawhoseentriesarearrangedsequentiallyHead:ThebeginningofthelistTail:Theendofthelist第5页

TerminologyforStacksStack:AlistinwhichentriesareremovedandinsertedonlyattheheadLIFO:Last-in-first-outTop:Theheadoflist(stack)Bottomorbase:Thetailoflist(stack)Pop:ToremovetheentryatthetopPush:Toinsertanentryatthetop第6页

TerminologyforQueuesQueue:AlistinwhichentriesareremovedattheheadandareinsertedatthetailFIFO:First-in-first-out第7页

Figure8.2Anexampleofanorganizationchart第8页

TerminologyforaTreeTree:AcollectionofdatawhoseentrieshaveahierarchicalorganizationNode:AnentryinatreeRootnode:ThenodeatthetopTerminalorleafnode:Anodeatthebottom第9页

TerminologyforaTree(continued)Parent:ThenodeimmediatelyaboveaspecifiednodeChild:AnodeimmediatelybelowaspecifiednodeAncestor:Parent,parentofparent,etc.Descendent:Child,childofchild,etc.Siblings:Nodessharingacommonparent第10页

TerminologyforaTree(continued)Binarytree:AtreeinwhicheverynodehasatmosttwochildrenDepth:Thenumberofnodesinlongestpathfromroottoleaf第11页

Figure8.3Treeterminology第12页

AdditionalConceptsStaticDataStructures:SizeandshapeofdatastructuredoesnotchangeDynamicDataStructures:SizeandshapeofdatastructurecanchangePointers:Usedtolocatedata第13页

Figure8.4Novelsarrangedbytitlebutlinkedaccordingtoauthorship第14页

StoringArraysHomogeneousarraysRow-majororderversuscolumnmajororderAddresspolynomialHetero