(-----01-----)
1) Array
2) Recursion
3) Pointer
4) Data Structure
5)Linked-list
6) Tree
(-----02-----)
A data structure can be defined as a collection of data objects that provide a way to store and manage data on a computer so that it can be used. There are different types of data structures like arrays, linked lists, stacks, queues, etc. Data structures are widely used for simple and complex calculations in almost every field of computer science. Data structures are used in all areas of computer science such as artificial intelligence, graphics, operating systems, etc. Data structures are an integral part of many computer algorithms, as they allow programmers to manage data efficiently. Proper selection of data structures can further improve the efficiency of computer programs or algorithms.
(-----03-----)
© Applications of the trees:
1) The Domain Name Server (DNS) uses tree structures.
2) XML parser uses tree algorithms.
3) Databases use tree data structures for indexing.
© Applications of a graph:
1) Google has something to do with the Knowledge Graph.
2)The graph API of Facebook uses the structure of the graph.
© Applications of a stack:
1) The Syntaxes in languages are parsed using stacks.
2) It is used in many virtual machines like JVM.
3) Infix is converting to postfix expressions by it.
© Applications of a queue:
1) Operating System uses queue for job scheduling.
2) For handling congestion in networking queue can be used.
3) In communication data packs are arranged in queue format.