1. Introduction To DS
   1. What Is Data Structure
   2. Need Of Data Structure
   3. Advantages Of Data Structure
      1. Efficiency
      2. Reusability
      3. Abstraction
      4. Efficiency of a program depends upon the choice of data structures.
      5. Data structures are reusable.
      6. Data structure is specified by the ADT which provides a level of abstraction.
   4. Types Of Data Structure
      1. Primitive Data Structure
      2. Non-Primitive Data Structure
         1. Linear
            1. Static
            2. Array
            3. Dynamic
            4. Linked List
            5. Stack
            6. Queue
         2. Non-Linear
            1. Tree
            2. Graph
   5. Data Structure Operations
      1. 1.Traversing
      2. 2.Insertion
      3. 3.Deletion
      4. 4.Searching
      5. 5.Sorting
      6. 6.Merging
   6. - group of data elements which provides an efficient way of storing and organising data. - Some examples of Data Structures are arrays, Linked List, Stack, Queue, etc.
2. Stack & Queue
3. Linked List
4. Tree
5. Sorting & Hashing
6. Graph