
Introduction To DS
 What Is Data Structure
 Need Of Data Structure

Advantages Of Data Structure
 Efficiency
 Reusability
 Abstraction
 Efficiency of a program depends upon the choice of data structures.
 Data structures are reusable.
 Data structure is specified by the ADT which provides a level of abstraction.

Types Of Data Structure
 Primitive Data Structure

NonPrimitive Data Structure

Linear
 Static
 Array
 Dynamic
 Linked List
 Stack
 Queue

NonLinear
 Tree
 Graph

Data Structure Operations
 1.Traversing
 2.Insertion
 3.Deletion
 4.Searching
 5.Sorting
 6.Merging
  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.

Stack & Queue

Stack
 What is Stack ?

Operations of Stack
 Push()
 pop()
 peek()/top()
 isEmpty()
 isFull()
 Insert operation is called push operation.
 Delete operation is called pop operation.

Ways To Implement Stack
 Static
 Dynamic

Queue
 What is Queue ?

Operation of Queue
 enqueue()
 dequeue()
 Insert operation is called enqueue operation.
 delete operation is called enqueue operation.

Linked List
 What is Linked List ?
 Why use a linked list over an array?

Types of Linked List

Singly Linked List

Operation on SLL
 Insertion
 Insertion at beginning
 Insertion at end of list
 insertion after specified list
 Deletion
 Deletion at beginning
 Deletion at the end of list
 Deletion after specified node
 Traversing
 Searching
 Doubly Linked List
 Circular Linked List
 Doubly Circular Linked List
 Tree
 Sorting & Hashing
 Graph