This article needs additional citations for verification. (August 2010) (Learn how and when to remove this template message) 
This article uses HTML markup. (May 2020) 
In computer science, a tree is a widely used abstract data type (ADT) that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.
A tree data structure can be defined recursively as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated, and none points to the root.
Alternatively, a tree can be defined abstractly as a whole (globally) as an ordered tree, with a value assigned to each node. Both these perspectives are useful: while a tree can be analyzed mathematically as a whole, when actually represented as a data structure it is usually represented and worked with separately by node (rather than as a set of nodes and an adjacency list of edges between nodes, as one may represent a digraph, for instance). For example, looking at a tree as a whole, one can talk about "the parent node" of a given node, but in general as a data structure a given node only contains the list of its children, but does not contain a reference to its parent (if any).
Preliminary definition
A tree is a nonlinear data structure, compared to arrays, linked lists, stacks and queues which are linear data structures. A tree can be empty with no nodes or a tree is a structure consisting of one node called the root and zero or one or more subtrees.
Mathematical definition
Unordered tree
Mathematically, an unordered tree^{[1]} (or "algebraic tree"^{[2]}) can be defined as an algebraic structure where X is the nonempty carrier set of nodes and parent is a function on X which assigns each node x its "parent" node, parent(x). The structure is subject to the condition that every nonempty subalgebra must have the same fixed point. That is, there must be a unique "root" node r, such that parent(r) = r and for every node x, some iterative application parent(parent(...parent(x)...)) equals r.
There are several equivalent definitions. As the closest alternative, one can define unordered trees as partial algebras (X, parent) which are obtained from the total algebras described above by letting parent(r) be undefined. That is, the root r is the only node on which the parent function is not defined and for every node x, the root is reachable from x in the directed graph (X, parent). This definition is in fact coincident with that of an antiarborescence. The TAoCP book uses the term oriented tree.^{[3]}
An unordered tree is a structure (X, ≺) where X is a set of nodes and ≺ is a childtoparent relation between nodes such that:  
(1)  X is nonempty. 

(2)  X is weakly connected in ≺. 
(3)  ≺ is functional. 
(4)  ≺ satisfies ACC: there is no infinite sequence x_{1} ≺ x_{2} ≺ x_{3} ≺ ···. 
The box on the right contains what can be regarded as a canonical definition
of unordered trees. It just describes the partial algebra (X, parent) as a relational structure (X, ≺). Moreover, dedicated terminology can be provided for generalizations of unordered trees that correspond to distinguished subsets of the listed conditions:
(3) – directed pseudoforest,
(4) – directed acyclic graph ^{[a]},
(3,4) – unordered forest
,
(1,2,3) – directed pseudotree.
Another equivalent definition of an unordered tree is that of a settheoretic tree that is singlyrooted and whose height is at most ω (a finiteish
tree^{[4]}). That is, the algebraic structures (X, parent) are equivalent to partial orders that have a top element r and whose every principal upset (aka principal filter) is a finite chain.
To be precise, we should speak about an inverse settheoretic tree since the settheoretic definition usually employs opposite ordering.
The correspondence between (X, parent) and (X, ≤) is established via reflexive transitive closure / reduction, with the reduction resulting in the "partial" version without the root cycle.
The definition of trees in descriptive set theory (DST) utilizes the representation of partial orders (X, ≥) as prefix orders between finite sequences. In turns out that up to isomorphism, there is a onetoone correspondence between the (inverse of) DST trees and the tree structures defined so far.
We can refer to the four equivalent characterizations as to tree as an algebra, tree as a partial algebra, tree as a partial order, and tree as a prefix order. There is also a fifth equivalent definition – that of a graphtheoretic rooted tree which is just a connected acyclic rooted graph.
The expression of trees as (partial) algebras (X, parent) follows directly the implementation of tree structures using parent pointers. Typically, the partial version is used in which the root node has no parent defined. However, in some implementations or models even the parent(r) = r circularity is established. Notable examples:
 The Linux VFS where "The root dentry has a d_parent that points to itself" ^{[5]}.
 The concept of an instantiation tree ^{[6]}^{[7]}^{[8]} from objectoriented programming. In this case, the root node is the top metaclass – the only class that is a direct instance of itself.
Note that the above definition admits infinite trees. This allows for the description of infinite structures supported by some implementations via lazy evaluation. A notable example is the infinite regress of eigenclasses from the Ruby object model.^{[9]}
In this model, the tree established via superclass
links between nonterminal objects is infinite and has an infinite branch (a single infinite branch of "helix" objects – see the diagram).
Sibling sets
In every unordered tree (X, parent) there is a distinguished partition of the set X of nodes into sibling sets. Two nonroot nodes x, y belong to the same sibling set if parent(x) = parent(y). The root node r forms the singleton sibling set {r}. ^{[b]} A tree is said to be locally finite or finitely branching if each of its sibling sets is finite.
Each pair of distinct siblings is incomparable in ≤. This is why the word unordered is used in the definition. Such a terminology might become misleading when all sibling sets are singletons, i.e. when the set X of all nodes is totally ordered (and thus wellordered) by ≤. In such a case we might speak about a singlybranching tree instead.
Using set inclusion
As with every partially ordered set, tree structures (X, ≤) can be represented by inclusion order – by set systems in which ≤ is coincident with ⊆, the induced inclusion order. Consider a structure (U, ℱ) such that U is a nonempty set, and ℱ is a set of subsets of U such that the following are satisfied (by Nested Set Collection definition):
 ∅ ∉ ℱ. (That is, (U, ℱ) is a hypergraph.)
 U ∈ ℱ.
 For every X, Y from ℱ, X ∩ Y ∈ {∅, X, Y}. (That is, ℱ is a laminar family.^{[10]})
 For every X from ℱ, there are only finitely many Y from ℱ such that X ⊆ Y.
Then the structure (ℱ, ⊆) is an unordered tree whose root equals U. Conversely, if (U, ≤) is an unordered tree, and ℱ is the set {↓x  x ∈ U} of all principal ideals of (U, ≤) then the set system (U, ℱ) satisfies the above properties.
The setsystem view of tree structures provides the default semantic model – in the majority of most popular cases, tree data structures represent containment hierarchy. This also offers a justification for order direction with the root at the top: The root node is a greater container than any other node. Notable examples:
 Directory structure of a file system. A directory contains its subdirectories.
 DOM tree. The document parts correspondent to DOM nodes are in subpart relation according to the tree order.
 Single inheritance in objectoriented programming. An instance of a class is also an instance of a superclass.
 Hierarchical taxonomy such as the Dewey Decimal Classification with sections of increasing specificity.
 BSP trees, quadtrees, octrees, Rtrees and other tree data structures used for recursive space partitioning.
Wellfounded trees
An unordered tree (X, ≤) is wellfounded if the strict partial order < is a wellfounded relation. In particular, every finite tree is wellfounded. Assuming the axiom of dependent choice a tree is wellfounded if and only if it has no infinite branch.
Wellfounded trees can be defined recursively – by forming trees from a disjoint union of smaller trees. For the precise definition, suppose that X is a set of nodes. Using the reflexivity of partial orders, we can identify any tree (Y, ≤) on a subset of X with its partial order (≤) – a subset of X × X. The set ℛ of all relations R that form a wellfounded tree (Y, R) on a subset Y of X is defined in stages ℛ_{i}, so that ℛ = ⋃{ℛ_{i}  i is ordinal}. For each ordinal number i, let R belong to the ith stage ℛ_{i} if and only if R is equal to
 ⋃ℱ ∪ ((dom(⋃ℱ) ∪ {x}) × {x})
where ℱ is a subset of ⋃{ℛ_{k}  k < i} such that elements of ℱ are pairwise disjoint, and x is a node that does not belong to dom(⋃ℱ). (We use dom(S) to denote the domain of a relation S.) Observe that the lowest stage ℛ_{0} consists of singlenode trees {(x,x)} since only empty ℱ is possible. In each stage, (possibly) new trees R are built by taking a forest ⋃ℱ with components ℱ from lower stages and attaching a new root x atop of ⋃ℱ.
In contrast to the tree height which is at most ω, the rank of wellfounded trees is unlimited^{[11]}, see the properties of "unfolding".
Using recursive pairs
In computing, a common way to define wellfounded trees is via recursive ordered pairs
(F, x):
a tree is a forest F together with a fresh
node x.^{[12]}
A forest F in turn is a possibly empty set of trees with pairwise disjoint sets of nodes.
For the precise definition, proceed similarly as in the construction of names used in the settheoretic technique of forcing.
Let X be a set of nodes. In the superstructure over X,
define sets T, ℱ of trees and forests, respectively, and a map nodes : T → ℘(X)
assigning each tree t its underlying set of nodes
so that
(trees over X)  t ∈ T  ↔  t is a pair (F, x) from ℱ × X such that for all s ∈ F, x ∉ nodes(s),  
(forests over X)  F ∈ ℱ  ↔  F is a subset of T such that for every s,t ∈ F, s ≠ t, nodes(s) ∩ nodes(t) = ∅ ,  
(nodes of trees)  y ∈ nodes(t)  ↔  t = (F, x) ∈ T and either y = x or y ∈ nodes(s) for some s ∈ F . 
Circularities in the above conditions can be eliminated by stratifying each of T, ℱ and nodes into stages like in the previous subsection.
Subsequently, define a subtree
relation ≤ on T as the reflexive transitive closure of the immediate subtree
relation ≺ defined between trees by
s ≺ t ↔ s ∈ π_{1}(t)
where π_{1}(t) is the projection of t onto the first coordinate, i.e.
it is the forest F such that t = (F, x) for some x ∈ X.
It can be observed that (T, ≤) is a multitree: for every t ∈ T, the principal ideal ↓t ordered by ≤ is a wellfounded tree as a partial order. Moreover,
for every tree t ∈ T, its nodes
order structure (nodes(t), ≤_{t}) is given by x ≤_{t} y if and only if there are forests F, G ∈ ℱ such that both (F, x) and (G, y) are subtrees of t and (F, x) ≤ (G, y).
Using arrows
Another formalization as well as generalization of unordered trees can be obtained by reifying parentchild pairs of nodes. Each such ordered pair can be regarded as an abstract entity – an arrow
.
This results in a multidigraph
(X, A, s, t)
where
X is the set of nodes,
A is the set of arrows,
and s and t
are functions from A to X assigning each arrow its source and target, respectively.
The structure is subject to the following conditions:
 (1) (A, s ○ t^{–1}) is an unordered tree, as a total algebra.
 (2) The t map is a bijection between arrows and nodes.
In (1), the composition symbol ○ is to be interpreted lefttoright. The condition says that inverse consecutivity of arrows^{[c]} is a total childtoparent map. Let this parent map between arrows be denoted p, i.e. p = s ○��t^{−1}. Then we also have s = p ○ t, thus a multidigraph satisfying (1,2) can also be axiomatized as (X, A, p, t), with the parent map p instead of s as a definitory constituent. Observe that the root arrow is necessarily a loop, i.e. its source and target coincide.
An important generalization of the above structure is established by allowing the target map t to be manytoone. This means that (2) is weakened to
 (2') The t map is surjective – each node is the target of some arrow.
Note that condition (1) asserts that only leaf arrows are allowed to have the same target. That is, the restriction of t to the range of p is still injective.
Multidigraphs satisfying (1,2') can be called arrow trees
–
their tree characteristics is imposed on arrows rather than nodes.
These structures can be regarded as the most essential abstraction of the Linux VFS because they reflect the hardlink structure of filesystems. Nodes are called inodes, arrows are dentries (or hard links). The parent and target maps p and t are respectively represented by d_parent
and d_inode
fields in the dentry data structure.^{[13]}
Each inode is assigned a fixed file type, of which the
directory type plays a special role of designed parents
:
(a) only directory inodes can appear as hardlink source and
(b) a directory inode cannot appear as the target of more than one hardlink.
Using dashed style for the first half of the root loop indicates that, similarly to the parent map, there is a partial version for the source map s in which the source of the root arrow is undefined. This variant is employed for further generalization, see #Using paths in a multidigraph.
Using paths in a digraph
Unordered trees naturally arise by "unfolding" of accessible pointed graphs.^{[14]} Let ℛ = (X, R, r) be a pointed relational structure, i.e. such that X is the set of nodes, R is a relation between nodes (a subset of X × X), and r is a distinguished "root" node. Assume further that ℛ is accessible, which means that X equals the preimage of {r} under the reflexive transitive closure of R, and call such a structure an accessible pointed graph or apg for short.(⁎) Then one can derive another apg ℛ' = (X', R', r') – the unfolding of ℛ – as follows:
 X' is the set of reversed paths to r, i.e. the set of nonempty finite sequences p of nodes (elements of X) such that (a) consecutive members of p are inversely Rrelated, and (b) the first member of p is the root r,
 R' is a relation between paths from X' such that paths p and q are R'related if and only if p = q ⁎ [x] for some node x (i.e. q is a maximal proper prefix of p, the "popped" p), and
 r' is the oneelement sequence [r].
Apparently, the structure (X', R') is an unordered tree in the "partialalgebra" version: R' is a partial map that relates each nonroot element of X' to its parent by path popping. The root element is obviously r'. Moreover, the following properties are satisfied:

ℛ is isomorphic to its unfolding ℛ'
if and only if
ℛ is a tree (⁑).
(In particular, unfolding is idempotent, up to isomorphism.)  Unfolding preserves wellfoundedness: If R is wellfounded then so is R'.
 Unfolding preserves rank: If R is wellfounded then the ranks of R and R' coincide.
 (⁎)
To establish a concordancy between R and the parent map, the presented definition uses reversed accessibility:
r is reachable from any node. In the original definition by P. Aczel^{[14]}, every node is reachable from r (thus, instead of
preimage
, the wordimage
applies).^{[d]}  (⁑) We have implicitly introduced a definition of unordered trees as apgs: call an apg ℛ = (X, R, r) a tree if the reduct (X, R) is an unordered tree as a partial algebra. This can be translated as: Every node is accessible by exactly one path.
Using paths in a multidigraph
As shown on the example of hardlink structure of file systems, many data structures in computing allow multiple links between nodes.
Therefore,
in order to properly exhibit the appearance of unordered trees among data structures it is necessary to generalize accessible pointed graphs to multidigraph setting.
To simplify the terminology, we make use of the term quiver which is an established synonym for multidigraph
.
Let an accessible pointed quiver or apq for short
be defined as a structure
ℳ = (X, A, s, t)
where
X is a set of nodes,
A is a set of arrows,
s is a partial function from A to X (the source map),
and t is a total function from A to X (the target map).
Thus, ℳ is a partial multidigraph
.
The structure is subject to the following conditions:
 There is exactly one
root
arrow, a_{r}, whose source s(a_{r}) is undefined.  Every node x ∈ X is reachable via a finite sequence of consecutive arrows starting with the root arrow a_{r}.
ℳ is said to be a tree if the target map t is a bijection between arrows and nodes. The unfolding of ℳ is formed by the sequences mentioned in (2) – which are the accessibility paths (cf. Path algebra). As an apq, the unfolding can be written as ℳ' = (X', A', s', t') where X' is the set of accessibility paths, A' coincides with X', s' coincides with path popping, and t' is the identity on X'. Like with apgs, unfolding is idempotent and always results in a tree. The underlying apg is obtained as the structure (X, R, t(a_{r})) where R = {(t(a),s(a))  a ∈ A \ {a_{r}}}.
The diagram above shows an example of an apq with 1+14 arrows. In JavaScript, Python or Ruby, the structure can be created by the following (exactly the same) code:
r = {};
r[1] = {}; r[2] = r[1]; r[3] = {}; r[4] = {};
r[1][5] = {}; r[1][14] = r[1][5];
r[3][7] = {}; r[3][8] = r[3][7]; r[3][13] = {};
r[4][9] = r[4]; r[4][10] = r[4]; r[4][11] = {};
r[3][7][6] = r[3]; r[3][7][12] = r[1][5];
Using names
Unordered trees and their generalizations form the essence of naming systems. There are two prominent examples of naming systems: file systems and (nested) associative arrays. The multidigraphbased structures from previous subsections provided anonymous abstractions for both cases. To obtain naming capabilities, arrows are to be equipped with names as identifiers. A name must be locally unique – within each sibling set of arrows^{[e]} there can be at most one arrow labelled by a given name.
source

name

target

s(a)  σ(a)  t(a) 

This can be formalized as a structure ℰ = (X, Σ, A, s, σ, t) where X is a set of nodes, Σ is a set of names, A is a set of arrows, s is a partial function from A to X, σ is a partial function from A to Σ, and t is a total function from A to X. For an arrow a, constituents of the triple (s(a), σ(a), t(a)) are respectively a's source, name and target. The structure is subject to the following conditions.
 The reduct (X, A, s, t) is an accessible pointed quiver (apq) as defined previously.
 The name function σ is undefined just for the sourceless root arrow.
 The name function σ is injective in the restriction to every sibling set of arrows, i.e. for every nonroot arrows a, b, if s(a) = s(b) and σ(a) = σ(b) then a = b.
This structure can be called a nested dictionary or named apq.
In computing, such structures are ubiquitous.
The table above shows that arrows can be considered unreified
as the set
A' = {(s(a), σ(a), t(a))  a ∈ A \ {a_{r}}}
of sourcenametarget triples.
This leads to a relational structure (X, Σ, A')
which can be viewed as a
relational database table.
Underlines in
source
and
name
indicate primary key.
The structure can be rephrased as a
deterministic labelled transition system:
X is a set of states
, Σ is a set of labels
, A' is a set of labelled transitions
.
(Moreover, the root node r = t(a_{r}) is an initial state
, and the accessibility condition means that every state is reachable from the initial state.)
The diagram on the right shows a nested dictionary ℰ that has the same underlying multidigraph as the example in the previous subsection. The structure can be created by the code below. Like before, exactly the same code applies for JavaScript, Python and Ruby.
First, a substructure, ℰ_{0}, is created
by a single assignment of a literal {...}
to r
.
This structure, depicted by full lines, is an arrow tree
(therefore, it is a spanning tree).
The literal in turn appears to be a JSON serialization of ℰ_{0}.
Subsequently, the remaining arrows are created by assignments of already existing nodes. Arrows that cause cycles are displayed in blue.
r = {"a":{"a":5,"b":5},"c":{"a":{"w":5},"c":{}},"d":{"w":1.3}}
r["b"] = r["a"]; r["c"]["b"] = r["c"]["a"]
r["c"]["a"]["p"] = r["c"]; r["d"]["e"] = r["d"]["self"] = r["d"]
In the Linux VFS, the name function σ is represented by the d_name
field in the dentry data structure.^{[13]}
The ℰ_{0} structure above demonstrates a correspondence between JSONrepresentable structures and hardlink structures of file systems.
In both cases, there is a fixed set of builtin types of nodes
of which one type is a container type, except that in JSON, there are in fact two such types
– Object and Array. If the latter one is ignored (as well as the distinction between individual primitive data types) then the provided abstractions of filesystems and JSON data are the same
–
both are arrow trees equipped with naming σ and a distinction of container nodes.
Pathnames
The naming function σ of a nested dictionary ℰ naturally extends from arrows to arrow paths.
Each sequence p = [a_{1}, …, a_{n}] of consecutive arrows is implicitly assigned a pathname (cf. Pathname)
– the sequence
σ(p) = [σ(a_{1}), …, σ(a_{n})] of arrow names.^{[f]}
Local uniqueness carries over to arrow paths: different sibling paths have different pathnames.
In particular, the rootoriginating arrow paths are in onetoone correspondence with their pathnames.
This correspondence provides a symbolic
representation of the unfolding of ℰ via pathnames
–
the nodes in ℰ are globally identified via a tree of pathnames.
Ordered tree
The structures introduced in the previous subsection form just the core "hierarchical" part of tree data structures that appear in computing. In most cases, there is also an additional "horizontal" ordering between siblings. In search trees the order is commonly established by the "key" or value associated with each sibling, but in many trees that is not the case. For example, XML documents, lists within JSON files, and many other structures have order that does not depend on the values in the nodes, but is itself data — sorting the paragraphs of a novel alphabetically would lose information.^{[dubious – discuss]}
The correspondent expansion of the previously described tree structures (X, ≤) can be defined by endowing each sibling set with a linear order as follows.^{[16]}^{[17]} An alternative definition according to Kuboyama^{[1]} is presented in the next subsection.
An ordered tree is a structure (X, ≤_{V}, ≤_{S}) where X is a nonempty set of nodes and ≤_{V} and ≤_{S} are relations on X called vertical (or also hierarchical^{[1]}) order and sibling order, respectively. The structure is subject to the following conditions:
 (X, ≤_{V}) is a partial order that is an unordered tree as defined in the previous subsection.
 (X, ≤_{S}) is a partial order.
 Distinct nodes are comparable in <_{S} if and only if they are siblings: (<_{S}) ∪ (>_{S}) = ((≺_{V}) ○ (≻_{V})) ∖ id_{X}.
(The following condition can be omitted in the case of finite trees.)
 Every node has only finitely many preceding siblings, i.e. every principal ideal of (X, ≤_{S}) is finite.
Conditions (2) and (3) say that (X, ≤_{S}) is a componentwise linear order, each component being a sibling set. Condition (4) asserts that if a sibling set S is infinite then (S, ≤_{S}) is isomorphic to (ℕ, ≤), the usual ordering of natural numbers.
Given this, there are three (another) distinguished partial orders which are uniquely given by the following prescriptions:
(<_{H}) = (≤_{V}) ○ (<_{S}) ○ (≥_{V}) (the horizontal order), (<_{L⁻}) = (>_{V}) ∪ (<_{H}) (the "discordant" linear order), (<_{L⁺}) = (<_{V}) ∪ (<_{H}) (the "concordant" linear order).
This amounts to a "VSHL^{±}" system of five partial orders ≤_{V}, ≤_{S}, ≤_{H}, ≤_{L⁺}, ≤_{L⁻} on the same set X of nodes, in which, except for the pair { ≤_{S}, ���_{H} }, any two relations uniquely determine the other three, see the determinacy table.
Notes about notational conventions:
 The relation composition symbol ○ used in this subsection is to be interpreted lefttoright (as ).
 Symbols < and ≤ express the strict and nonstrict versions of a partial order.
 Symbols > and ≥ express the converse relations.
 The ≺ symbol is used for the covering relation of ≤ which is the immediate version of a partial order.
This yields six versions ≺, <, ≤, ≻, >, ≥ for a single partial order relation. Except for ≺ and ≻, each version uniquely determines the others. Passing from ≺ to < requires that < be transitively reducible. This is always satisfied for all of <_{V}, <_{S} and <_{H} but might not hold for <_{L⁺} or <_{L⁻} if X is infinite.
The partial orders ≤_{V} and ≤_{H} are complementary: (<_{V}) ⊎ (>_{V}) ⊎ (<_{H}) ⊎ (>_{H}) = X × X ∖ id_{X}. As a consequence, the "concordant" linear order <_{L⁺} is a linear extension of <_{V}. Similarly, <_{L⁻} is a linear extension of >_{V}.
The covering relations ≺_{L⁻} and ≺_{L⁺} correspond to preorder traversal and postorder traversal, respectively. If x ≺_{L⁻} y then, according to whether y has a previous sibling or not, the x node is either the "rightmost" nonstrict descendant of the previous sibling of y or, in the latter case, x is the first child of y. Pairs of the latter case form the relation (≺_{L⁻}) ∖ (<_{H}) which is a partial map that assigns each nonleaf node its first child node. Similarly, (≻_{L⁺}) ∖ (>_{H}) assigns each nonleaf node with finitely many children its last child node.
Definition using horizontal order
The Kuboyama's definition of "rooted ordered trees"^{[1]} makes use of the horizontal order ≤_{H} as a definitory relation.^{[g]} (See also Suppes.^{[18]}) Using the notation and terminology introduced so far, the definition can be expressed as follows.
An ordered tree is a structure (X, ≤_{V}, ≤_{H}) such that conditions (1–5) are satisfied:
 (X, ≤_{V}) is a partial order that is an unordered tree. (The vertical order.)
 (X, ≤_{H}) is a partial order. (The horizontal order.)

The partial orders
≤_{V} and
≤_{H}
are complementary:
(<_{V})
⊎
(>_{V})
⊎
(<_{H})
⊎
(>_{H})
=
X × X
∖
id_{X}.
(That is, pairs of nodes that are incomparable in (<_{V}) are comparable in (<_{H}) and vice versa.) 
The partial orders
≤_{V} and
≤_{H}
are "consistent":
(<_{H})
=
(≤_{V})
○
(<_{H})
○
(≥_{V}).
(That is, for every nodes x, y such that x <_{H} y, all descendants of x must precede all the descendants of y.)
(Like before, the following condition can be omitted in the case of finite trees.)
 Every node has only finitely many preceding siblings. (That is, for every infinite sibling set S, (S, ≤_{H}) has the order type of the natural numbers.)
The sibling order (≤_{S}) is obtained by (<_{S}) = (<_{H}) ∩ ((≺_{V}) ○ (≻_{V})), i.e. two distinct nodes are in sibling order if and only if they are in horizontal order and are siblings.
Determinacy table
The following table shows the determinacy of the "VSHL^{±}" system. Relational expressions in the table's body are equal to one of <_{V}, <_{S}, <_{H}, <_{L⁻}, or <_{L⁺} according to the column. It follows that except for the pair { ≤_{S}, ≤_{H} }, an ordered tree (X, ...) is uniquely determined by any two of the five relations.
<_{V}  <_{S}  <_{H}  <_{L⁻}  <_{L⁺}  

V,S  (≤_{V}) ○ (<_{S}) ○ (≥_{V})  
V,H  (<_{H}) ∩ ((≺_{V})○(≻_{V}))  (>_{V}) ∪ (<_{H})  (<_{V}) ∪ (<_{H})  
V,L⁻  (<_{L⁻}) ∩ ((≺_{V})○(≻_{V}))  (<_{L⁻}) ∖ (>_{V})  
V,L⁺  (<_{L⁺}) ∩ ((≺_{V})○(≻_{V}))  (<_{L⁺}) ∖ (<_{V})  
H,L⁻  (>_{L⁻}) ∖ (<_{H})  
H,L⁺  (<_{L⁺}) ∖ (<_{H})  
L⁻,L⁺  (>_{L⁻}) ∩ (<_{L⁺})  (<_{L⁻}) ∩ (<_{L⁺})  
S,L⁻  x ≺_{V} y ↔ y = inf_{L⁻}(Y) where Y is the image of {x} under (≥_{S})○(≻_{L⁻})  
S,L⁺  x ≺_{V} y ↔ y = sup_{L⁺}(Y) where Y is the image of {x} under (≤_{S})○(≺_{L⁺}) 
In the last two rows,
inf_{L⁻}(Y) denotes the infimum of Y in
(X, ≤_{L⁻}),
and
sup_{L⁺}(Y) denotes the supremum of Y in
(X, ≤_{L⁺}).
In both rows, (≤_{S}) resp. (≥_{S}) can be equivalently replaced by the sibling equivalence
(≤_{S})○(≥_{S}).
In particular, the partition into sibling sets together with either of
≤_{L⁻} or
≤_{L⁺}
is also sufficient to determine the ordered tree.
The first prescription for ≺_{V} can be read as:
the parent of a nonroot node x equals the infimum of the set of all immediate
predecessors of siblings of x, where the words infimum
and predecessors
are meant w.r.t. ≤_{L⁻}.
Similarly with the second prescription, just use supremum
, successors
and
≤_{L⁺}.
The relations ≤_{S} and ≤_{H} obviously cannot form a definitory pair. For the simplest example, consider an ordered tree with exactly two nodes – then one cannot tell which of them is the root.
XPath Axes
XPath Axis  Relation 

ancestor

<_{V} 
ancestororself

≤_{V} 
child

≻_{V} 
descendant

>_{V} 
descendantorself

≥_{V} 
following

<_{H} 
followingsibling

<_{S} 
parent

≺_{V} 
preceding

>_{H} 
precedingsibling

>_{S} 
self

id_{X} 
The table on the right shows a correspondence of introduced relations to XPath axes, which are used in structured document systems to access nodes that bear particular ordering relationships to a starting "context" node. For a context node^{[19]}x, its axis named by the specifier in the left column is the set of nodes that equals the image of {x} under the correspondent relation. As of XPath 2.0, the nodes are "returned" in document order, which is the "discordant" linear order ≤_{L⁻}. A "concordance" would be achieved, if the vertical order ≤_{V} was defined oppositely, with the bottomup direction outwards the root like in set theory in accordance to natural trees.^{[h]}
Traversal maps
Below is the list of partial maps that are typically used for ordered tree traversal.^{[20]} Each map is a distinguished functional subrelation of ≤_{L⁻} or of its opposite.
 ≺_{V} ... the parentnode partial map,
 ≻_{S} ... the previoussibling partial map,
 ≺_{S} ... the nextsibling partial map,
 (≺_{L⁻}) ∖ (<_{H}) ... the firstchild partial map,
 (≻_{L⁺}) ∖ (>_{H}) ... the lastchild partial map,
 ≻_{L⁻} ... the previousnode partial map,
 ≺_{L⁻} ... the nextnode partial map.
Generating structure
The traversal maps constitute a partial unary algebra^{[21]}(X, parent, previousSibling, ..., nextNode) that forms a basis for representing trees as linked data structures. At least conceptually, there are parent links, sibling adjacency links, and first / last child links. This also applies to unordered trees in general, which can be observed on the dentry data structure in the Linux VFS.^{[22]}
Similarly to the "VSHL^{±}" system of partial orders, there are pairs of traversal maps that uniquely determine the whole ordered tree structure. Naturally, one such generating structure is (X, ≺_{V}, ≺_{S}) which can be transcribed as (X, parent, nextSibling) – the structure of parent and nextsibling links. Another important generating structure is (X, firstChild, nextSibling) known as leftchild rightsibling binary tree. This partial algebra establishes a onetoone correspondence between binary trees and ordered trees.
Definition using binary trees
The correspondence to binary trees provides a concise definition of ordered trees as partial algebras.
An ordered tree is a structure where X is a nonempty set of nodes, and lc, rs are partial maps on X called leftchild and rightsibling, respectively. The structure is subject to the following conditions:
 The partial maps lc and rs are disjoint, i.e. (lc) ∩ (rs) = ∅ .
 The inverse of (lc) ∪ (rs) is a partial map p such that the partial algebra (X, p) is an unordered tree.
The partial order structure (X, ≤_{V}, ≤_{S}) is obtained as follows:
(≺_{S}) = (rs), (≻_{V}) = (lc) ○ (≤_{S}).
Encoding by sequences
Ordered trees can be naturally encoded by finite sequences of natural numbers.^{[23]}^{[i]} Denote ω^{⁎} the set of all finite sequences of natural numbers. Then any nonempty subset W of ω^{⁎} that is closed under taking prefixes gives rise to an ordered tree: just take the prefix order for ≥_{V} and the lexicographical order for ≤_{L⁻}. Conversely, for an ordered tree T = (X, ≤_{V}, ≤_{L⁻}) assign each node x the sequence of sibling indices, i.e. the root is assigned the empty sequence and for every nonroot node x, let w(x) = w(parent(x)) ⁎ [i] where i is the number of preceding siblings of x and ⁎ is the concatenation operator. Put W = {w(x)  x ∈ X}. Then W, equipped with the induced orders ≤_{V} (the inverse of prefix order) and ≤_{L⁻} (the lexicographical order), is isomorphic to T.
Perlevel ordering
As a possible expansion of the "VSHL^{±}" system, another distinguished relations between nodes can be defined, based on the tree's level structure. First, let us denote by ∼_{E} the equivalence relation defined by x ∼_{E} y if and only if x and y have the same number of ancestors. This yields a partition of the set of nodes into levels L_{0}, L_{1}, ... (, L_{n}) – a coarsement of the partition into sibling sets. Then define relations <_{E}, <_{B⁻} and <_{B⁺} by
It can be observed that <_{E} is a strict partial order and <_{B⁻} and <_{B⁺} are strict total orders. Moreover, there is a similarity between the "VSL^{±}" and "VEB^{±}" systems: <_{E} is componentwise linear and orthogonal to <_{V}, <_{B⁻} is linear extension of <_{E} and of >_{V}, and <_{B⁺} is a linear extension of <_{E} and of <_{V}.
Terminology used in trees
Data type versus data structure
There is a distinction between a tree as an abstract data type and as a concrete data structure, analogous to the distinction between a list and a linked list. As a data type, a tree has a value and children, and the children are themselves trees; the value and children of the tree are interpreted as the value of the root node and the subtrees of the children of the root node. To allow finite trees, one must either allow the list of children to be empty (in which case trees can be required to be nonempty, an "empty tree" instead being represented by a forest of zero trees), or allow trees to be empty, in which case the list of children can be of fixed size (branching factor, especially 2 or "binary"), if desired.
As a data structure, a linked tree is a group of nodes, where each node has a value and a list of references to other nodes (its children). There is also the requirement that no two "downward" references point to the same node. In practice, nodes in a tree commonly include other data as well, such as next/previous references, references to their parent nodes, or nearly anything.
Due to the use of references to trees in the linked tree data structure, trees are often discussed implicitly assuming that they are being represented by references to the root node, as this is often how they are actually implemented. For example, rather than an empty tree, one may have a null reference: a tree is always nonempty, but a reference to a tree may be null.
Recursive
Recursively, as a data type a tree is defined as a value (of some data type, possibly empty), together with a list of trees (possibly an empty list), the subtrees of its children; symbolically:
t: v [t[1], ..., t[k]]
(A tree t consists of a value v and a list of other trees.)
More elegantly, via mutual recursion, of which a tree is one of the most basic examples, a tree can be defined in terms of forest (a list of trees), where a tree consists of a value and a forest (the subtrees of its children):
f: [t[1], ..., t[k]] t: v f
Note that this definition is in terms of values, and is appropriate in functional languages (it assumes referential transparency); different trees have no connections, as they are simply lists of values.
As a data structure, a tree is defined as a node (the root), which itself consists of a value (of some data type, possibly empty), together with a list of references to other nodes (list possibly empty, references possibly null); symbolically:
n: v [&n[1], ..., &n[k]]
(A node n consists of a value v and a list of references to other nodes.)
This data structure defines a directed graph,^{[j]} and for it to be a tree one must add a condition on its global structure (its topology), namely that at most one reference can point to any given node (a node has at most a single parent), and no node in the tree point to the root. In fact, every node (other than the root) must have exactly one parent, and the root must have no parents.
Indeed, given a list of nodes, and for each node a list of references to its children, one cannot tell if this structure is a tree or not without analyzing its global structure and that it is in fact topologically a tree, as defined below.
Type theory
As an ADT, the abstract tree type T with values of some type E is defined, using the abstract forest type F (list of trees), by the functions:
 value: T → E
 children: T → F
 nil: () → F
 node: E × F → T
with the axioms:
 value(node(e, f)) = e
 children(node(e, f)) = f
In terms of type theory, a tree is an inductive type defined by the constructors nil (empty forest) and node (tree with root node with given value and children).
Mathematical
Viewed as a whole, a tree data structure is an ordered tree, generally with values attached to each node. Concretely, it is (if required to be nonempty):
 A rooted tree with the "away from root" direction (a more narrow term is an "arborescence"), meaning:
 A directed graph,
 whose underlying undirected graph is a tree (any two vertices are connected by exactly one simple path),
 with a distinguished root (one vertex is designated as the root),
 which determines the direction on the edges (arrows point away from the root; given an edge, the node that the edge points from is called the parent and the node that the edge points to is called the child),
together with:
 an ordering on the child nodes of a given node, and
 a value (of some data type) at each node.
Often trees have a fixed (more properly, bounded) branching factor (outdegree), particularly always having two child nodes (possibly empty, hence at most two nonempty child nodes), hence a "binary tree".
Allowing empty trees makes some definitions simpler, some more complicated: a rooted tree must be nonempty, hence if empty trees are allowed the above definition instead becomes "an empty tree or a rooted tree such that ...". On the other hand, empty trees simplify defining fixed branching factor: with empty trees allowed, a binary tree is a tree such that every node has exactly two children, each of which is a tree (possibly empty). The complete sets of operations on the tree must include fork operation.
Terminology
A node is a structure which may contain a value or condition, or represent a separate data structure (which could be a tree of its own). Each node in a tree has zero or more child nodes, which are below it in the tree (by convention, trees are drawn growing downwards). A node that has a child is called the child's parent node (or ancestor node, or superior). A node has at most one parent.
An internal node (also known as an inner node, inode for short, or branch node) is any node of a tree that has child nodes. Similarly, an external node (also known as an outer node, leaf node, or terminal node) is any node that does not have child nodes.
The topmost node in a tree is called the root node. Depending on definition, a tree may be required to have a root node (in which case all trees are nonempty), or may be allowed to be empty, in which case it does not necessarily have a root node. Being the topmost node, the root node will not have a parent. It is the node at which algorithms on the tree begin, since as a data structure, one can only pass from parents to children. Note that some algorithms (such as postorder depthfirst search) begin at the root, but first visit leaf nodes (access the value of leaf nodes), only visit the root last (i.e., they first access the children of the root, but only access the value of the root last). All other nodes can be reached from it by following edges or links. (In the formal definition, each such path is also unique.) In diagrams, the root node is conventionally drawn at the top. In some trees, such as heaps, the root node has special properties. Every node in a tree can be seen as the root node of the subtree rooted at that node.
The height of a node is the length of the longest downward path to a leaf from that node. The height of the root is the height of the tree. The depth of a node is the length of the path to its root (i.e., its root path). This is commonly needed in the manipulation of the various selfbalancing trees, AVL Trees in particular. The root node has depth zero, leaf nodes have height zero, and a tree with only a single node (hence both a root and leaf) has depth and height zero. Conventionally, an empty tree (tree with no nodes, if such are allowed) has height −1.
A subtree of a tree T is a tree consisting of a node in T and all of its descendants in T.^{[k]}^{[24]} Nodes thus correspond to subtrees (each node corresponds to the subtree of itself and all its descendants) – the subtree corresponding to the root node is the entire tree, and each node is the root node of the subtree it determines; the subtree corresponding to any other node is called a proper subtree (by analogy to a proper subset).
Drawing trees
Trees are often drawn in the plane. Ordered trees can be represented essentially uniquely in the plane, and are hence called plane trees, as follows: if one fixes a conventional order (say, counterclockwise), and arranges the child nodes in that order (first incoming parent edge, then first child edge, etc.), this yields an embedding of the tree in the plane, unique up to ambient isotopy. Conversely, such an embedding determines an ordering of the child nodes.
If one places the root at the top (parents above children, as in a family tree) and places all nodes that are a given distance from the root (in terms of number of edges: the "level" of a tree) on a given horizontal line, one obtains a standard drawing of the tree. Given a binary tree, the first child is on the left (the "left node"), and the second child is on the right (the "right node").
Representations
There are many different ways to represent trees; common representations represent the nodes as dynamically allocated records with pointers to their children, their parents, or both, or as items in an array, with relationships between them determined by their positions in the array (e.g., binary heap).
Indeed, a binary tree can be implemented as a list of lists (a list where the values are lists): the head of a list (the value of the first term) is the left child (subtree), while the tail (the list of second and subsequent terms) is the right child (subtree). This can be modified to allow values as well, as in Lisp Sexpressions, where the head (value of first term) is the value of the node, the head of the tail (value of second term) is the left child, and the tail of the tail (list of third and subsequent terms) is the right child.
In general a node in a tree will not have pointers to its parents, but this information can be included (expanding the data structure to also include a pointer to the parent) or stored separately. Alternatively, upward links can be included in the child node data, as in a threaded binary tree.
Generalizations
Digraphs
If edges (to child nodes) are thought of as references, then a tree is a special case of a digraph, and the tree data structure can be generalized to represent directed graphs by removing the constraints that a node may have at most one parent, and that no cycles are allowed. Edges are still abstractly considered as pairs of nodes, however, the terms parent and child are usually replaced by different terminology (for example, source and target). Different implementation strategies exist: a digraph can be represented by the same local data structure as a tree (node with value and list of children), assuming that "list of children" is a list of references, or globally by such structures as adjacency lists.
In graph theory, a tree is a connected acyclic graph; unless stated otherwise, in graph theory trees and graphs are assumed undirected. There is no onetoone correspondence between such trees and trees as data structure. We can take an arbitrary undirected tree, arbitrarily pick one of its vertices as the root, make all its edges directed by making them point away from the root node – producing an arborescence – and assign an order to all the nodes. The result corresponds to a tree data structure. Picking a different root or different ordering produces a different one.
Given a node in a tree, its children define an ordered forest (the union of subtrees given by all the children, or equivalently taking the subtree given by the node itself and erasing the root). Just as subtrees are natural for recursion (as in a depthfirst search), forests are natural for corecursion (as in a breadthfirst search).
Via mutual recursion, a forest can be defined as a list of trees (represented by root nodes), where a node (of a tree) consists of a value and a forest (its children):
f: [n[1], ..., n[k]] n: v f
Traversal methods
Stepping through the items of a tree, by means of the connections between parents and children, is called walking the tree, and the action is a 'walk' of the tree. Often, an operation might be performed when a pointer arrives at a particular node. A walk in which each parent node is traversed before its children is called a preorder walk; a walk in which the children are traversed before their respective parents are traversed is called a postorder walk; a walk in which a node's left subtree, then the node itself, and finally its right subtree are traversed is called an inorder traversal. (This last scenario, referring to exactly two subtrees, a left subtree and a right subtree, assumes specifically a binary tree.) A levelorder walk effectively performs a breadthfirst search over the entirety of a tree; nodes are traversed level by level, where the root node is visited first, followed by its direct child nodes and their siblings, followed by its grandchild nodes and their siblings, etc., until all nodes in the tree have been traversed.
Common operations
 Enumerating all the items
 Enumerating a section of a tree
 Searching for an item
 Adding a new item at a certain position on the tree
 Deleting an item
 Pruning: Removing a whole section of a tree
 Grafting: Adding a whole section to a tree
 Finding the root for any node
 Finding the lowest common ancestor of two nodes
Common uses
 Representing hierarchical data such as syntax trees
 Storing data in a way that makes it efficiently searchable (see binary search tree and tree traversal)
 Representing sorted lists of data
 As a workflow for compositing digital images for visual effects^{[citation needed]}
 Storing BarnesHut trees used to simulate galaxies.
See also
 Tree structure
 Tree (graph theory)
 Tree (set theory)
 Cardinal tree and Ordinal tree
 Hierarchy (mathematics)
 Dialog tree
 Single inheritance
 Generative grammar
 Hierarchical clustering
 Binary space partition tree
 Recursion
 Fenwick tree
Other trees
 Trie
 Day–Stout–Warren algorithm
 Enfilade
 Left childright sibling binary tree
 Hierarchical temporal memory
Notes
 ^ Apart from the finiteness condition.
 ^ Alternatively, a "partial" version can be employed by excluding .
 ^ Arrows a and b are said to be consecutive, respectively, if t(a) = s(b).
 ^ However, some authors also introduce the definition with reversed reachability.^{[15]}
 ^ I.e. arrows that have the same source node.
 ^ Here we assume that the root arrow a_{r} is not in p.
 ^ Unfortunately, the author uses the term sibling order for the horizontal order relation. This is nonstandard, if not a misnomer.
 ^ This would also establish a concordance of the two possible directions of inequality symbols with the categorization of XPath axes into forward axes and reverse axes.
 ^ In general, any alphabet equipped with ordering that is isomorphic to that of natural numbers can be used.
 ^ Properly, a rooted, ordered directed graph.
 ^ This is different from the formal definition of subtree used in graph theory, which is a subgraph that forms a tree – it need not include all descendants. For example, the root node by itself is a subtree in the graph theory sense, but not in the data structure sense (unless there are no descendants).
References
 ^ ^{a} ^{b} ^{c} ^{d} Tetsuji Kuboyama (2007). "Matching and learning in trees" (PDF). Doctoral Thesis, University of Tokyo.
 ^ "The Linux VFS Model: Naming structure".
 ^ Donald Knuth. The Art of Computer Programming, Volume 1: Fundamental Algorithms, Third Edition. AddisonWesley, 1997. Section 2.3.4.2: Oriented trees.
 ^
Unger, Spencer (2012). "Trees in Set Theory" (PDF). Cite journal requires
journal=
(help)  ^ Bruce Fields. "Notes on the Linux kernel".
 ^ Pierre Cointe (1987). "Metaclasses are First Class: the ObjVlisp Model". Proceeding OOPSLA '87 Conference Proceedings on Objectoriented Programming Systems, Languages and Applications. NorthHolland.
 ^ Wolfgang Klas, Michael Schrefl (1995). Metaclasses and Their Application: Data Model Tailoring and Database Integration. Springer.
 ^ "What Is a Metaclass?".
 ^ "The Ruby Object Model: Data structure in detail".
 ^ B. Korte, and J. Vygen (2012). Combinatorial optimization. Springer, Heidelberg.
 ^ Dasgupta, Abhiit (2014). Set theory: with an introduction to real point sets. New York: Birkhäuser.
 ^ Makinson, David (2012). Sets, logic and maths for computing. Springer Science & Business Media. ISBN 9781447124993.
 ^ ^{a} ^{b} Bovet, Daniel; Cesati, Marco (2005). Understanding the Linux Kernel. O'Reilly. ISBN 9780596554910.
 ^ ^{a} ^{b} Aczel, Peter (1988), Nonwellfounded sets., CSLI Lecture Notes, 14, Stanford, CA: Stanford University, Center for the Study of Language and Information, ISBN 0937073229, MR 0940014
 ^ A. S. Daghighi, M. Golshani, J. D. Hamkins, and E. Jeřábek (2014). "The foundation axiom and elementary selfembeddings of the universe". Infinity, Computability, and Metamathematics: Festschrift Celebrating the 60th Birthdays of Peter Koepke and Philip Welch. arXiv:1311.0814. Bibcode:2013arXiv1311.0814S. CiteSeerX 10.1.1.764.742.CS1 maint: uses authors parameter (link)
 ^
Jan Hidders; Philippe Michiels; Roel Vercammen (2005). "Optimizing sorting and duplicate elimination in XQuery path expressions" (PDF). Cite journal requires
journal=
(help)  ^ Frithjof Dau; Mark Sifer (2007). "A formalism for navigating and editing XML document structure" (PDF). International Workshop on Databases in Networked Information Systems. Springer, Berlin, Heidelberg.
 ^ Suppes, Patrick (1973). "Semantics of contextfree fragments of natural languages". Approaches to Natural Language. Springer, Dordrecht: 370–394. CiteSeerX 10.1.1.398.2289. doi:10.1007/9789401025065_21. ISBN 9789027702333.
 ^ "XML Path Language (XPath) 3.1". World Wide Web Consortium. 21 March 2017.
 ^ "Document Object Model Traversal". W3C. 2000.
 ^ "Unary Algebras".
 ^ J.T. Mühlberg, G. Lüttgen (2009). "Verifying compiled file system code". Formal Methods: Foundations and Applications: 12th Brazilian Symposium on Formal Methods. Springer, Berlin, Heidelberg. CiteSeerX 10.1.1.156.7781. Cite journal requires
journal=
(help)  ^ L. Afanasiev; P. Blackburn; I. Dimitriou; B. Gaiffe; E. Goris; M. Marx; M. de Rijke (2005). "PDL for ordered trees" (PDF). Journal of Applied NonClassical Logics. 15 (2): 115–135. doi:10.3166/jancl.15.115135.
 ^ Weisstein, Eric W. "Subtree". MathWorld.
Further reading
 Donald Knuth. The Art of Computer Programming: Fundamental Algorithms, Third Edition. AddisonWesley, 1997. ISBN 0201896834 . Section 2.3: Trees, pp. 308–423.
 Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGrawHill, 2001. ISBN 0262032937 . Section 10.4: Representing rooted trees, pp. 214–217. Chapters 12–14 (Binary Search Trees, RedBlack Trees, Augmenting Data Structures), pp. 253–320.
External links
Wikimedia Commons has media related to Tree structures. 
 Data Trees as a Means of Presenting Complex Data Analysis by Sally Knipe in August 8, 2013
 Description from the Dictionary of Algorithms and Data Structures
 CRAN  Package data.tree implementation of a tree data structure in the R programming language
 WormWeb.org: Interactive Visualization of the C. elegans Cell Tree – Visualize the entire cell lineage tree of the nematode C. elegans (javascript)
 Binary Trees by L. Allison