Category:Data structures

In computer science, a data structure is a way of storing data in a computer so that it can be used efficiently. Often a carefully chosen data structure will allow a more efficient algorithm to be used. The choice of the data structure must begin from the choice of an abstract data structure.

Subcategories

There is 1 subcategory to this category.

T

• Trees (structure)

Articles in category "Data structures"

There are 43 articles in this category.

2-3 heap A Abstract data structure Adjacency list Array Associative array B Bit array Bloom filter Buffer gap D Data structure Database Source Name Deque Disjoint-set data structure Dope vector F Fibonacci heap

G Global array Graph-structured stack H Hash table Heap I Iliffe vector J Judy array L Linked list List List of data structures Lookup table M Matrix representation Mutual exclusion P Packed storage matrix Parallel array Persistent data structure

P cont. Priority queue Q Queue R Raster graphics Record (computer science) S Scene graph Skip list Soft heap Sparse array Stack (computing) T Tagged union U Union (computer science) Unrolled linked list V VList X Xor linked list