Scribd
Upload
32 views

List of Interesting Data Structures: Arrays

This document lists and defines various data structures used in computer science. It includes linear data structures like arrays, lists, and strings. It also includes trees like binary search trees, B-trees, tries, and graphs like adjacency lists and matrices. Finally, it mentions heaps, hashes, and other structures like symbol tables, routing tables, and quad-edge meshes.

Uploaded by

accessmadhu_88116517
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views

List of Interesting Data Structures: Arrays

This document lists and defines various data structures used in computer science. It includes linear data structures like arrays, lists, and strings. It also includes trees like binary search trees, B-trees, tries, and graphs like adjacency lists and matrices. Finally, it mentions heaps, hashes, and other structures like symbol tables, routing tables, and quad-edge meshes.

Uploaded by

accessmadhu_88116517
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

List of Interesting Data Structures

Arrays
Array
Bidirectional map
Bit array
Bit field
Bitboard
Bitmap
Circular buffer
Control table
Dynamic array
Gap buffer
Hashed array tree
Heightmap
Iliffe vector
Image
Lookup table
Matrix
Parallel array
Sorted array
Sparse array
Sparse matrix
Variable-length array
Application-specific trees
Abstract syntax tree
Alternating decision tree
Decision tree
Expectiminimax tree
Finger tree
Game tree
Minimax tree
Parse tree
Syntax tree
Binary trees
AA tree
AVL tree
Binary search tree
Binary tree
Cartesian tree
Pagoda
Randomized binary search tree
Red-black tree
Rope
Scapegoat tree
Self-balancing binary search tree
Splay tree
Tango tree
Threaded binary tree
Top tree
Treap
T-tree
Weight-balanced tree
B-trees
2-3 tree
2-3-4 tree
B sharp tree
B tree
B*-tree
B+ tree

Bx-tree
Dancing tree
Fusion tree
Queap

Disjoint-set data structure


Enfilade
Exponential tree
Fenwick tree
Fusion tree
Link/cut tree
Spaghetti stack
SPQR-tree
Ternary search tree
Van Emde Boas tree

Graphs
Adjacency list
Adjacency matrix
And-inverter graph
Binary decision diagram
Directed acyclic graph
Directed graph
Space-partitioning trees
Graph
Adaptive k-d tree
Graph-structured stack
Bin
Hypergraph
BK-tree
Multigraph
Bounding interval hierarchy
Propositional directed acyclic graph
BSP tree
Scene graph
Cover tree
Zero suppressed decision diagram
Hilbert R-tree
Implicit kd-tree
Interval tree
Hashes
Kdb tree
Bloom filter
Kd-tree
Distributed hash table
Linear octree
Hash array mapped trie
Metric tree
Hash list
Min/max kd-tree
Hash table
M-tree
Hash tree
Octree
Hash trie
Quadtree
Koorde
R* tree
Prefix hash tree
R+ tree
Range tree
Heaps
Rapidly-exploring random tree
2-3 heap
R-tree
AF-heap
Segment tree
Beap
UB-tree
Binary heap
VP-tree
Binomial heap
X-tree
D-ary heap
Z-order
Fibonacci heap
Heap
Tries
Leftist heap
B-trie
Pairing heap
Compressed suffix array
Skew heap
Ctrie
Soft heap
FM-index
Ternary heap
Generalised suffix tree
Treap
Judy array
Radix tree
Lists
Suffix array
Doubly connected edge list
Suffix tree
Doubly linked list
Trie
Linked list
X-fast trie
Self-organizing list
Y-fast trie
Skip list
Unrolled linked list
Other
VList
Lightmap
Xor linked list
Quad-edge
Zipper
Routing table
Symbol table
Multiway trees
Winged edge
(a,b)-tree
Andor tree

You might also like