Veri yapıları listesi

Taban veri yapıları değiştir

Genel tipler	Özel tipler
Basit tipler	Karakter Tam sayı Dize (string) Double Float
Bileşik tipler	Yapı Bit alanı Birlik Tagged union Gap Buffer

General type	Specific types
List (or vector or sequence)	Dizi Bitmaps Images Heightfields Dinamik Dizi Parallel array Sparse array Matrix Sparse matrix Bitboard
	Bağlı liste Unrolled linked list Xor linked list Doubly linked list
	VList
	Buffer Stack Queue Priority queue Double-ended priority queue Deque Circular buffer
Associative array (a.k.a. dictionary or map)	Hash table
	Self-balancing binary search tree
	Skip list

Genel tipler	Özel tipler
Çizge	Adjacency list Adjacency matrix Disjoint-set data structure Graph-structured stack Scene graph
Ağaç veri yapıları	M-Way Tree B-tree 2-3 tree 2-3-4 tree B+ tree Generalized search tree B* tree B# tree UB tree R tree Hilbert R-tree R+ tree R* tree Enfilade
	K-ary tree Binary tree Binary heap Binary search trees (each tree node compares entire key values) Self-balancing binary search trees AVL tree Dancing tree Red-black tree AA tree Scapegoat tree Splay tree Top Trees Interval tree Treap Exponential tree
	Trie family (each tree node compares a bitslice of key values) Kd trie Radix tree Sparse trie Hash trie Suffix tree Directed Acyclic Word Graph (DAWG) Generalised suffix tree van Emde Boas tree
	Heap Binary heap Binomial heap Fibonacci heap 2-3 heap Soft heap Pairing heap Leftist heap Treap Beap Skew heap
	Other Search Trees (a,b) tree Fusion tree
	Syntax tree Abstract syntax tree Parse tree
	Space partitioning Bounding interval hierarchy Bounding volume hierarchy BSP tree Kd tree Adaptive kd tree Implicit kd tree Kdb tree Octree Quadtree
	Diğer ağaçlar And-or tree Hash tree Metric tree BK tree Cover tree M tree VP tree Finger tree 2-3 finger tree AVL finger tree Non-lazy finger tree
	Decision theory Binary decision diagram Decision tree Alternating decision tree Minimax tree Expectiminimax tree