Image: Wikimedia Commons

tree

Abstract data type

Also known as tree structure · tree data structure

Instance of: abstract data type
Subclass of: data structure

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

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, 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", 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.

Overview

All data

16 statements · 13% with external sources · numbers in brackets are citations

Different from: Baum criterion used: descriptive page and disambiguation page have to be in different items · applies to name of subject: Baum
trie
Based on: tree

On other databases

10 identifiers linking tree across the web's reference databases

Data quality

statements

13%

externally sourced

Source last edited October 10, 2026. AIDB refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q223655

API docs, limits & keys

Cite this page

AIDB. (2026). tree (Q223655). Retrieved from https://aidb.si/e/tree-Q223655