An organization of information, usually in memory, for better algorithm efficiency. It may include redundant information, such as length of the list or number of nodes in a subtree.

Data Structures

Note: Some of these items are in the list more than once. This is because they fall into more than one type.

queue
bounded queue

stack
bounded stack
cactus stack

linked list
doubly linked list
skip list
ordered linked list
circular list

heap
binary heap
k-ary heap
Fibonacci Heap
priority queue
treap
complete binary tree

dictionary
association list
hash table
B-tree

tree
B-tree
binary tree
balanced tree
multiway tree
ordered tree
binary search tree

Log in or registerto write something here or to contact authors.