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

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. 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 in a single straight line.

Property Value
dbo:abstract
• 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. 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 in a single straight line. Binary trees are a commonly used type, which constrain the number of children for each parent to exactly 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. The abstract data type 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. (en)
dbo:thumbnail
dbo:wikiPageID
• 30806 (xsd:integer)
dbo:wikiPageLength
• 17401 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
• 1084348103 (xsd:integer)
dbp:align
• center (en)
dbp:caption
• : cycle B→C→E→D→B. B has more than one parent . (en)
• Each linear list is trivially (en)
• : two non-connected parts, A→B and C→D→E. There is more than one root. (en)
• : undirected cycle 1-2-4-3. 4 has more than one parent . (en)
• : cycle A→A. A is the root but it also has a parent. (en)
dbp:image
• Directed Graph Edge.svg (en)
• Directed graph with branching SVG.svg (en)
• Directed graph, cyclic.svg (en)
• Directed graph, disjoint.svg (en)
• Graph single node.svg (en)
dbp:width
• 92 (xsd:integer)
• 101 (xsd:integer)
• 130 (xsd:integer)
• 173 (xsd:integer)
• 211 (xsd:integer)
dbp:wikiPageUsesTemplate
dct:subject
gold:hypernym
rdf:type
rdfs:comment
• 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. 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 in a single straight line. (en)
rdfs:label
• Tree (data structure) (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of