Määritelmä
DataStructureSACollectionOfDataelementWithstructuralCharakteristics.ITStudiestHelogicalStructureOfDATANADThefysicalStructureofData, AswellasTheInteractionBetWeEnthemRelations- ja DesignTheCorrespestCalculationsForthissuredEfinitions, jaAnsurethatTheNewstructureObnatedfterthESecalculations -MamaininsTheoriginalsuuretypestytypesetytypesetypeseEcationyCalculations -.Iske."Rakenne" refertotherelationshiptHatexistsBetweEnDataelements, joka on levinnyttologinenstructureNDSTORAGESTRUCTURE.
ThelogicalstructureandphysicalstructureofdataaretwocloselyrelatedaspectsfaTaStructure.ThesamelogicalstructurecancoresespondToDifferentStoragestruces.ThedesignfthealgoritmdependsonthelogicalstructureofThedata -.
TheresearchContentenfataStructureisTheBasisforconstructingComplexSoftWaresystems.ThedatacanbedividedentothreelevelsthroughDecomption; vitahroughabstraktio, thespesificcontententHedataelementsisDiscarded, jaThelogicalstructureSobnated.Samoin sivujakautumisenhalkaisutoiminnot ja senybyAbtractioningingTheTheShectionalsions,.THEEABOOBOVETWOASPECTSCANTRANSFORMESTHEPROBLEMINTOADataStructure.TämäISaprocessFromConcrete (thitis, concreteProblems) Toabtract (thatis, tietorakenteet).Sitten, yhdenmukaistamisen mukauttamisen käsittely, theestoragestructureaLedTheShectioningoperationRefurtherobnated, SotastocompetetedESignTaskSkerationRefurthertHerned,.Tämä imeprocessfromabstraktio (Thatis, tietorakenne) betonille (thatis, betoni toteutus).
ResearchObject
Thelogicalstructureofdata
RefertTheDataStructureThatReflectsTheLogicalRelationshipBetWeEndAelements.ThelogicalRelationshipisbetweendataelements.TherelationhipbetBetBetForeandafter, AndhasnothingTodowithheirstorageLocationInTheComputer.ThelogicalStructure kuuluu:
1.SET: Siellä onOoterrelationshipBetWeEelementsInTheDataStructureExceptForthemUtualRelationshipship "bondolingTothesameset";
2.Lineaarinen rakenne: ElementsInTheDataStructureHave One-to-One -suhde;
3.Puurakenne: ElementsInTheDataStructureHave One-mony-suhde;
4.Graafinen rakenne: ElementsintHeDataStructure.
ThefysicalstructureofThedata
ReferStoThestorageformOfThelogicalStructureOfTaintHESCOMPUTRESTORAGESPACE.
ThefysicalstructureofdataistherepresentationfataStructureInTheComputer (AlsokNownastheImage), joka sisältyy dataelementsin ja kanssa.SinincetherEMultiplesSpecificimplemmenationMethodssuchasSekvenssi, linkki, hakemisto, hash jne.., adatastructurecanbeexpresseDasoneormoresTrageStructures.
In-MachinerePresentationofDataelements (MappingMethod): AbitstringofbinaryBits (bitti) on käytetty.TämäKindofbitstringisususalcalledeDanode.WanaDataelementConsistOfseveraldataitems, thesub-bitstringCorrespongingToeachDatIMintheBitstringiscalleDataField.Siksi, silleodeistheinternalRepresentation (orinternalimage) of theDataelement.
Machinerepresentationofrelationship -sovellukset (MappingMethod): Thein-MachinerePresentationofrelationshipsbetweDaEaelementsCanbedivideTeNosequentIMageSInnon-SequentialImages.TwocommonlyUsedstoragestructures: SequentialStoragestructureandChainstoragestryure.SekvenceMappingUSestherelativePositionfeelementsInthememoryToRePresentTheLogicalRelationshipBetWeEndataelements.Ei-sekventialmappingusesPoiintersThatindicatestorageLocationationsofelementStoRepresentLogicalRelationshipsbetweDaEaelements.
Datastoragestructure
ThestorageformOftHelogicalstructureOfDatainTheComputerToragespaceCalledThephysicalstructureOftHEDATA -.Yleisesti ottaen, thelogicalstructureofataStructurecanbeexpresseDasavariefatefataStructurecanbeexPresseDasavariefyofStoragestucturesAnneded.CommonstoragestructurescluLLESEQUENTIANSSTORE, CHATCHSTORE, INDEXSTORE, Andhashstorage.
Thecharacteristicofthesequentialstoragestructureofdatais:thelogicalrelationshipbetweenthedataelementsisexpressedbytherelativepositionoftheelementinthememory;thecharacteristicofnon-sequentialstorageis:thedataisexpressedbythepointerindicatingthestorageaddressoftheelementThelogicalrelationshipbetweenelements.
Luokittelu
Siellä.Yleisesti ottaen, data-arvoinen luokiteltu.
Lineaarinen
Yksinkertaisestitu, alinearstructuremeansThateachNodeinTheTeAbleHasalInearRelationship.IfesDescribedInTHelangagefaTaStructure
1.Thelinearstructureisanon-impyset.
2.ThelinearstructureHasoneanLonlyonestartNodeanDoneEndNode.
3.AllNodesOfThelinearstructureHaveatmelonEdirectPredpestornodeanDonedirectSuccessornode.
Lineareblesaretypicallinearstructuurs, ja -luvut, jonot ja stringsarealLineaarinens.
Epälineaarinen
Yksinkertaisestitu, anonlineaaristructureMeansThattherAremultiplecorresponencesvertNodeInTheTeAble.IFDESCRIBEDInTHELIGUAGEOFDATAStruktuuri
1.Thenlinearstructureisanon-empyset.
2.AnodeofanonlinearstructureMayHavemultipledirectpredpestornodesandMultipledirectSuccessornodes.
InpracticalApplications, tietorakenteelliset.
Yleisesti käytettydatastruktuurit
Ajalla.Yleisesti käytettyDataStructureInProgramdesignincluLTefollowing.
Taulukko (taulukko)
Arrayisanaggregraterateype, joka onSacollectionOfseveralvariablesofTheSameTypeArganizedTogetherInOrderyManner.ArrayCanbesAidTobethemostBasicDataStructure, joka vastaa.AnarrayCanbedEcomponedInMultipLearrayelements.Mukana, jotka.ArrayScanalsObeexpressedinoni-ulottuvuus-, kaksiulotteiset ja mitoitusmuodot.
Pino (pino)
StackisaspeciallIntable.ItCanonlyinsertanddeletedatanodesononeFixedeDendofateble.ThestackstoresDataAccordingtothelast-infirst-outPrinciple, that, thedatasertedFirstwillbePushedtothebottomoftHESTACK, ja theDatasertedLastwillbeathetopoftHESTACK.WhatReadingData, iTisReadoutoneyOneFromtheToPOfThESTAck.ThestackisoftenusedForon-alusruokailu.WhenthereisNodaintHestack, ItiscalleDanEmpystack.
Jonottaa
ThequeueSimilarTothestack, jatulisalsoaspeciallLearable.UlkiketHestack, ThequeueOnlyAllowsInSerToperationononEnEfOfthetableandDeleteOperationsOntheOtHotherend.Yleisesti ottaminen, theendThaterformsheinsertionoperationSisceltedhetailofTheEquue ja theAndThatPerformSThedeleteOperationSiscaledTheHeadfeEquue.Whentherearenoelementsinthequeue,itiscalledanemptyqueue.
Linkedist
LinkedistAdataStructureInWhichDataelementsarestoreedAcordingtoAchaineSTraGestryure.ThisTragestructureisphysicalNon-pysyvä.ThelinkedListiscompoosedofaseriesofdatanodes, jaAchDatanodeSincludeStWoParts: DataFieldAndPointerfield.PointerfieldholdstheaddresswhereenexelementIntHeDataStructureSSTORED -ohjelman joukossa.ThelogicalorderOfTheDataelementsInThelInKleStructureisRealizedbyThelinkOrtOfthePointerInTheLinkedist.
Puu
PuuisatypicalNonLineartructure, jokaisafinitetkincludingtwonodes.IntthetReStructure, sensisonAnDonlyonerootNode, Whathasnopred Entryornodes.AllothernodesinthetReStructureHaveoneanLonlyOnepredornornode ja therecanbetwosuccessornodes, m≥0.
Kaavio
Kaavioisanothernon-lineaarirakenne.IntShegraphstructure, DatanodesareGenerallycalledvertices, AndEdgesareOrderedPairsOfvertices.Ifthereisanedgebetweentwovertices, se merkitsee.
Pino
Pinoisaspecialtree-muotoinenDataStructure ja TheHEHEAPSGeneralyDiscussedareBinaryPinos.ThecharacteristicfthepisthatTheValueftherootnodESTHESMAELESTORTHELArgestamongallNodes- jaThetWosubtreesOftherootnodEealSoahAPSTRUCTURE.
Hashtable (hash)
TheHashTableisderedfromthe Hash -toiminto (hash -funktio).TheideaishatifthereisarecordwiththeKeywordEqualToTinthStructure, tHenitmustherecordCanbefoundInthestorageLocationoff (t).
Yleisesti käytettylgoritmit
ThecontentofdataStructurereseart: howtoorganizethedataccordingtoAccartlogicalstructure, jaChoosethAPPRIPRATEESTORAGEREPRESENTARTIONMETHOTOCTORETHEDataorganizedInTheLogicalStructToTheComputer'sMemory.ThePurposeofalgorithmResearchistoprocessDatamoreEffectionAndInimProaTheteEfficiveSOfDataoperation.TheoperationOfDataisDefineTonthelogicalstructureofTheData -.Yleensä onVeReveralCommonlyUnedOperations:
(1) Etsi.Hakija.Yleisesti.
(2) Aseta.AddNewNodestoTheDataStructure.
(3) Poista.RemoveThecechefiedNodefromtheDataStructure.
(4) Päivitys.ChangeTheVeVeVoneOfoneMoreFieldSOfTHESCESCIEDNODE.
(5) Lajittelu.ResrangethenodesinaspecifiedOrder.Esimerkiksi lisäys tai väheneminen.