Data Structures is a particular way of storing and organizing data in a computer so that it can be used efficiently.
Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-Trees are particularly well-suited for implementation of databases, while compilers implementations usually use hash tables to look up identifiers.
Data structures provide a means to manage huge amounts of data efficiently, such as large and internet indexing services. Usually, efficient data structures are a key to design efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software.
OVERVIEW OF DATA STRUCTURES
ARRAYS AND MATRICES
HASH TABLES AND HASHING
SORTING, SEARCHING AND MERGING