Category:Trees (structure)

B

• [+] B-tree (8 P)
• [+] Binary trees (22 P)

D

• [+] Decision trees (16 P)

H

• [+] Heaps (structure) (15 P)

R

• [+] R-tree (3 P)

T

• [+] Tree programming languages (5 P)

T cont.

• [+] Trees (graph theory) (1 C, 26 P)
• [+] Trees (set theory) (10 P)

*

• Tree (data structure)

A

• (a,b)-tree
• AA tree
• Abstract syntax tree
• Adaptive k-d tree
• And–or tree

B

• B sharp tree
• B+ tree
• B-tree
• B-trie
• BK-tree
• Binary space partitioning
• Bounding interval hierarchy
• Branching factor

C

• Calkin–Wilf tree
• Concrete syntax tree
• Cover tree

D

• DSW algorithm
• Dancing tree
• Dendrogram
• Dialog tree
• Doubly-chained tree

E

• Embedded Zerotrees of Wavelet transforms
• Enfilade (Xanadu)
• Expectiminimax tree
• Exponential tree

F

• Fenwick tree

F cont.

• Figurative system of human knowledge
• Finger tree
• Fusion tree

G

• Generalised suffix tree
• GiST

H

• H tree
• Hash tree
• Hash trie
• Htree

I

• Implicit kd-tree
• Infinite tree automaton
• Interval tree

K

• Kd-tree

L

• Leaf node
• Leftist tree
• Linear octrees
• Link/cut tree

M

• Metric tree
• Min/max kd-tree

N

• Newick format
• Node (computer science)

O

• Octree

P

• Pebble automaton
• Phylogenetic tree
• PQ tree
• Prediction Suffix Tree

Q

• Quadtree

R

• R-tree
• Radix tree
• Range tree

S

• Segment tree
• Self-balancing binary search tree
• Sentinel node
• Sentinel value
• Split (phylogenetics)
• SPQR tree
• Stern–Brocot tree
• Suffix tree

T

• T-theory
• Ternary search tree
• User:Theresource/Fusion tree
• Tree homomorphism
• Tree traversal
• Tree automaton
• Tree structure
• Tree walking automaton
• Trie
• Trinomial tree

U

• UB-tree

V

• VP-tree
• Van Emde Boas tree

X

• X-tree