Contents

1. Introduction to Data Structures

1.1 Concept

1.2Need for data structures

1.3Some concepts and their definitions

1.4Abstract data type

1.5Implementation of a data structure

1.6types of data structures

2. Algorithm Analysis

2.1Introduction

2.2Characteristics of an algorithm

2.3Performance analysis

2.4Asymptotic notations

3. Linear Data Structures

3.1Introduction

3.2Array as an abstract data type

3.3Array representation

3.4Applications of arrays

3.5Sorting

4. Linked List

4.1Introduction

4.2 Concept of linked list

4.3Linked list implementation

4.4Types of linked lists

4.5Operations on a linked list

4.6Dynamic implementation of a singly linked list

4.7Doubly linked list

4.8Circular list

4.9Applications of linked list

4.10Generalized–linked list

4.11Other operations on linked lists

5. Stack

5.1 Introduction

5.2Concept of a stack

5.3Implementation of stack

5.4Applications of stack

5.5Recursion using implicit stack

5.6 Concept of multiple stacks

6. Queue

6.1Concept of a queue

6.2Operations on a queue

6.3Implementation of a linear queue

6.4Circular queue

6.5Doubly ended queue

6.6Priority queue

6.7 Multiple queues

6.8Applications of queue

7. Tree

7.1 Introduction

7.2Tree terminology

7.3Representation of binary trees

7.4Creating a binary search tree

7.5Tree traversals

7.6Operations on trees

7.7 Applications of tree

7.8 Height balanced trees

8. Graph

8.1Introduction and definition

8.2Graph representation

8.3Graph traversals

8.4Applications of graphs