An Entity of Type: building, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computer science, a linked data structure is a data structure which consists of a set of data records (nodes) linked together and organized by references (links or pointers). The link between data can also be called a connector. Linking can be done in two ways – using dynamic allocation and using array index linking. Linked data structures include linked lists, search trees, expression trees, and many other widely used data structures. They are also key building blocks for many efficient algorithms, such as topological sort and set union-find.

Property Value
dbo:abstract
  • Zřetězená datová struktura je v programech taková struktura, která obsahuje soubor záznamů (uzlů), které jsou mezi sebou propojené pomocí referencí (odkazy nebo ukazateli). Hlavním rozdílem mezi zřetězenou datovou strukturou a nezřetězenou je tedy to, že ve zřetězené musí být u každého prvku odkaz na další prvek/prvky v sekvenci, zatímco v nezřetězené struktuře probíhá přístup k dalšímu prvku pomocí dopočítání adresy v paměti. (cs)
  • In computer science, a linked data structure is a data structure which consists of a set of data records (nodes) linked together and organized by references (links or pointers). The link between data can also be called a connector. In linked data structures, the links are usually treated as special data types that can only be dereferenced or compared for equality. Linked data structures are thus contrasted with arrays and other data structures that require performing arithmetic operations on pointers. This distinction holds even when the nodes are actually implemented as elements of a single array, and the references are actually array indices: as long as no arithmetic is done on those indices, the data structure is essentially a linked one. Linking can be done in two ways – using dynamic allocation and using array index linking. Linked data structures include linked lists, search trees, expression trees, and many other widely used data structures. They are also key building blocks for many efficient algorithms, such as topological sort and set union-find. (en)
  • Em ciência da computação, uma estrutura de dados vinculada ou estrutura de dados ligada é uma estrutura de dados que consiste em um conjunto de registros de dados (nós) ligados entre si e organizados por referências (links ou ponteiros). A ligação entre dados também pode ser chamada de conector. Estruturas de dados vinculadas incluem listas ligadas, árvores de pesquisa, árvores de expressão, e muitas outras estruturas amplamente utilizadas. Elas são os blocos de construção para muitos algoritmos eficientes, tais como ordenação topológica e o Disjoint. (pt)
dbo:thumbnail
dbo:wikiPageID
  • 22474945 (xsd:integer)
dbo:wikiPageLength
  • 7926 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1077118457 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • Zřetězená datová struktura je v programech taková struktura, která obsahuje soubor záznamů (uzlů), které jsou mezi sebou propojené pomocí referencí (odkazy nebo ukazateli). Hlavním rozdílem mezi zřetězenou datovou strukturou a nezřetězenou je tedy to, že ve zřetězené musí být u každého prvku odkaz na další prvek/prvky v sekvenci, zatímco v nezřetězené struktuře probíhá přístup k dalšímu prvku pomocí dopočítání adresy v paměti. (cs)
  • Em ciência da computação, uma estrutura de dados vinculada ou estrutura de dados ligada é uma estrutura de dados que consiste em um conjunto de registros de dados (nós) ligados entre si e organizados por referências (links ou ponteiros). A ligação entre dados também pode ser chamada de conector. Estruturas de dados vinculadas incluem listas ligadas, árvores de pesquisa, árvores de expressão, e muitas outras estruturas amplamente utilizadas. Elas são os blocos de construção para muitos algoritmos eficientes, tais como ordenação topológica e o Disjoint. (pt)
  • In computer science, a linked data structure is a data structure which consists of a set of data records (nodes) linked together and organized by references (links or pointers). The link between data can also be called a connector. Linking can be done in two ways – using dynamic allocation and using array index linking. Linked data structures include linked lists, search trees, expression trees, and many other widely used data structures. They are also key building blocks for many efficient algorithms, such as topological sort and set union-find. (en)
rdfs:label
  • Zřetězené datové struktury (cs)
  • Linked data structure (en)
  • Estrutura de dados vinculada (pt)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License