Metraipolis › archive › dc_366b0a58582c

Tree (abstract data type) — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Tree_(abstract_data_type)
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-07T22:51:45.442Z
SHA-256 of the archived text: 59a56c72d2d68aca79713e023004e58b65670339344ab32db5824547ac9755c0
Stable URL of this page: https://metraipolis.com/documento/dc_366b0a58582c

How to cite

Tree (abstract data type) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Tree_(abstract_data_type) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_366b0a58582c (Metraipolis archive dc_366b0a58582c, sha256 59a56c72d2d68aca79713e023004e58b65670339344ab32db5824547ac9755c0)

BibTeX

@misc{dc366b0a58582c,
  title = {Tree (abstract data type) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Tree_(abstract_data_type)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_366b0a58582c; sha256 59a56c72d2d68aca79713e023004e58b65670339344ab32db5824547ac9755c0},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Tree_(abstract_data_type). Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computer science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Each node in the tree can be connected to many children (depending on the type of tree), but must be connected to exactly one parent, except for the root node, which has no parent (i.e., the root node as the top-most node in the tree hierarchy). These constraints mean there are no cycles or "loops" (no node can be its own ancestor), and also that each child can be treated like the root node of its own subtree, making recursion a useful technique for tree traversal. In contrast to linear data structures, many trees cannot be represented by relationships between neighboring nodes (parent and children nodes of a node under consideration, if they exist) in a single straight line (called edge or link between two adjacent nodes). Binary trees are a commonly used type, which constrain the number of children for each parent to at most two. When the order of the children is specified, this data structure corresponds to an ordered tree in graph theory. A value or pointer to other data may be associated with every node in the tree, or sometimes only with the leaf nodes, which have no children nodes. The abstract data type (ADT) can be represented in a number of ways, including a list of parents with pointers to children, a list of children with pointers to parents, or a list of nodes and a separate list of parent-child relations (a specific type of adjacency list). Representations might also be more complicated, for example using indexes or ancestor lists for performance. Trees as used in computing are similar to but can be different from mathematical constructs of trees in graph theory, trees in set theory, and trees in descriptive set theory.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Tree (abstract data type)» — https://en.wikipedia.org/wiki/Tree_(abstract_data_type)
Wikidata Q223655 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q223655
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Tree_(abstract_data_type)?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1317276420, consultata il 2026-10-07T22:26:37.472Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 5d6aa1660690b26346d67feb8240ffd51d5f324ec53303fd9e1e1db5ef2ce413