Contents

1. Introduction to Data Structures

1.1 Introduction     

1.2 Definition of data structure 

1.3 Data structure   

1.4 Abstract data type (Pre and Post Conditions)

1.5 Implementation of data structures

1.6 Analysis of programs   

1.7 Advantages of data structures

2. Array

2.1 Array as a data structure

2.2 Storage representation of arrays   

2.3 Applications of arrays

2.4 Polynomial representation using arrays

2.5 Sparse matrices

3. Linked List

3.1 Introduction

3.2 Drawbacks of sequential storage

3.3 Concept of a linked list

3.4 Implementation of linked list

3.5 Operations on a list

3.6 Operations on linked lists

3.7 Operations on circular lists

3.8 Operations on a linear doubly linked list

3.9 Difference between an array and linked list

3.10 Generalized linked list

4. Stack

4.1 Introduction

4.2 Definition of a stack

4.3 Operations on a stack

4.4 Implementation of a stack

4.5 Application of stacks

5. Queue

5.1 Introduction

5.2 Definition of a queue

5.3 Operations on a queue

5.4 Implementation of queues

5.5 Types of queues

5.6 Applications of queues

6. Tree

6.1 Introduction

6.2 Tree terminology

6.3 Binary trees

6.4 Representation of binary trees

6.5 Operations on binary trees

7. Binary Theaded Tree

7.1 Height balanced trees (AVL Tree)

7.2 B – trees

7.3 Expression tree

7.4 Threaded binary tree

8. Graph

8.1 Introduction

8.2 Graph representation

8.3 Graph traversals

8.4 Applications of graphs