Category:Data structures

From Freepedia

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 54 articles in this category.

2 2-3 heap A Abstract data structure Adjacency list Array Associative array B Binary decision diagram Bit array Bloom filter Buffer gap C Crit bit tree D Data structure Database Source Name Database dump Deque Disjoint-set data structure Dope vector F Fibonacci heap G Global array

G cont. Graph (data structure) Graph-structured stack H Hash table Heap I Iliffe vector J Judy array L Linked list List List of data structures List of publications in computer science Literal pool Lookup table M Matrix representation Mutual exclusion N Node (computer science) P Packed storage matrix Parallel array Persistent data structure Priority queue

P cont. Process control block Q Queue R Raster graphics Relocation table S Scene graph Skip list Soft heap Sparse array Stack (computing) String (computer science) Suffix array T Tagged union Tree data structure U Union (computer science) Unrolled linked list V VList X Xor linked list