Trees (data structures)

abstract data type

branching diagram of evolutionary relationships between organisms

tree data structure whose nodes are recursively cryptographically hashed

thumb|250px|A trie for keys "A", "to", "tea", "ted", "ten", "i", "in", and "inn". Each complete English word has an arbitrary integer value associated with it.|alt=Depiction of a trie. Single empty circle, representing the root node, points to three children. The arrow to each child is marked by a different letter. The children themselves have similar sets of arrows and child nodes, with nodes that correspond to full words bearing blue integer values. In computer science, a trie (, ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store and ret

ordered, rooted tree that represents the syntactic structure of a string according to some context-free grammar

tree representation of the abstract syntactic structure of source code

thumb|Dendrogram of a hierarchical clustering (UPGMA) with the height of the nodes (adapted from bacterial 5S rRNA sequence data). thumb|Dendrogram output for hierarchical clustering of marine provinces using presence / absence of sponge species. thumb|A dendrogram of the Tree of Life. This phylogenetic tree is adapted from Woese et al. rRNA analysis. The vertical line at bottom represents the [[last universal common ancestor (LUCA).]] thumb|Heatmap of RNA-Seq data showing two dendrograms in the left and top margins.

thumb|Left: Recursive subdivision of a cube into octant (solid geometry)|octants. Right: The corresponding octree.

computer science term: compressed trie containing all the suffixes of the given text

class of algorithms

way of representing the hierarchical nature of a structure in a graphical form

thumb|300px|A point-region quadtree with point data. Bucket capacity 1. thumb|300x300px|Quadtree compression of an image step by step. Left shows the compressed image with the tree bounding boxes while the right shows just the compressed image A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are the two-dimensional analog of octrees and are most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions. The data associated with a leaf cell varies by application, but the leaf cell represents a

data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent

multidimensional search tree for points in k dimensional space

tree data structure used in computer science

any node-based binary search tree that automatically keeps its height small

infinite complete binary tree whose nodes correspond to the positive rational numbers

data structure that can efficiently update elements and calculate prefix sums in a table of numbers

list arranged to show hierarchical relationships

3-way tree data structure where every node's left subtree has keys less than the node's key, every middle subtree has keys equal to the node's key, and every right subtree has keys greater than the node's key

hybrid network topology

numerical method for the valuation of financial options

computing, tree data structures, and game theory value

tree in which the vertices correspond 1-for-1 to the positive rational numbers

thumb|Treemap of Singapore's exports by product category, 2012. The Product Exports Treemaps are one of the most recent applications of these kind of visualizations, developed by the Harvard-MIT Observatory of Economic Complexity.

In computing, GiST or Generalized Search Tree, is a data structure and API that can be used to build a variety of disk-based search trees. GiST is a generalization of the B+ tree, providing a concurrent and recoverable height-balanced search tree infrastructure without making any assumptions about the type of data being stored, or the queries being serviced. GiST can be used to easily implement a range of well-known indexes, including B+ trees, R-trees, hB-trees, RD-trees, and many others; it also allows for easy development of specialized indexes for new data types. It cannot be used directly

right-angled fractal canopy

data structure which consists of a set of data records (nodes) linked together and organized by references (links or pointers)

mathematical tree in the hyperbolic plane

type of infography

priority queue implemented with a variant of a binary heap

mathematical structure

tree data structure in which each node has at most k children

type of tree data structure

Taxonomy of human knowledge

state machine for tree structures

notation for representing graph-theoretical trees with edge lengths using parentheses and commas

data tree in which each node branches to three subsequent nodes with the infinite set of all nodes giving all (and only) primitive Pythagorean triples without duplication

concept in graph theory, a branch of mathematics

succinct data structure