a data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data. 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 compiler implementations usually use hash tables to look up identifiers.

Data structure is topic in programming language that deals with memory, sorting techniques etc. you can also define it as:



A data structure is a structured set of variables associated with one another in different ways, cooperatively defining components in the system and capable of being operated upon in the program. As stated earlier, the following operations are done on data structures:





Data organisation or clubbing



Accessing technique



Manipulating selections for information.





Data structures are the basis of programming tools and the choice of data structures should provide the following:





The data structures should satisfactorily represent the relationship between data elements.



The data structures should be easy so that the programmer can easily process the data.





Best of Luck!!!!!!!!!!!!

Data structure is the mechnanism of computer memory devices which process and operate on data, we can understand how data is stored in memory devices (like ram, hard disk) also it shows the way data is fetched from the devices during computation under supervising of o.s. . . Hope it makes you understand, though this is not a bookish definition, just in simple word

Data structure is a part of computer programing language. It helps to develop and solve the different problem with unique and easy way. In which are we study and use basically array, pointer, link-list,stack, que, graph,file and many more about problem solving technique.