Wikidata:WikiProject Informatics/Structures/List

This list is periodically updated by a bot. Manual changes to the list will be removed on the next update!

WDQS | PetScan | TABernacle | Find images | Recent changes | Query: SELECT DISTINCT ?item WHERE { ?item wdt:P31 wd:Q175263. }

label	average time complexity	worst-case time complexity	average space complexity	worst-case space complexity
(a,b)-tree
2–3 tree			O( n )	O(n)
2–3–4 tree
Addressable heap
Association list			O( n )	O(n)
B*-tree
B-heap
B-tree	O(\log n)	O(\log n) (insertion) O(\log n) (suppression) O(\log n) (recherche)	O(n)	O(n)
C-trie
Eertree
Emacs file variable
Fibonacci heap	\Theta(1)^[1] O(\lg n)^[1] O(1)^[1]
File Control Block
Fractal tree index
Geodatabase (Esri)
Hollerith constant
Job File Table
Kinetic heap
Left-leaning red–black tree			O(n)	O(n)
Log-structured merge-tree
Medizinisches Informationsobjekt
Mergeable heap
O-code
OLAP cube
Packetized Elementary Stream
Prefix hash tree
Priority search tree
Program Memory Area
Program Segment Prefix
R*-tree
R-tree
Relaxed k-d tree
Rendezvous
Scan-Line Interleave
Shadow heap
Stream
Task state segment
Zero page
adjacency list
beap
binary heap		\Theta(1)^[1] \Theta(\lg n)^[1] \Theta(n)^[1]	O(n)	O(n)
binary search tree			O( log (n) )	O(n)
bit field
cons
counting Bloom filter
credit line
disjoint-set data structure
exponential tree			O( n )	O(n)
graph data structure
hash table
hash tree
hashed array tree
inode
k-d tree
matrix representation
memory control block
min-max heap
nested set model
polygon mesh
quadtree
radix heap
range tree				O(n\log^{d-1} n)
red–black tree			O( n )	O(n)
scapegoat tree
segment tree				O(n)
semantic triple
skip graph
sorted array			O(n)	O(n)
splay tree
summed-area table
ternary search tree

∑ 71 items.

End of automatically generated list.

References