Contents

1. Introduction to Data Structure

1.1 Abstract data type: An introduction

1.2 Array

2. Sorting and Searching

2.1 Introduction to searching

2.2 Sorting - introduction

2.3 Sorting techniques

3. Stack and Queue

3.1 Stack

3.2 Representing stacks in C

3.4 Queue

3.5 Priority queue

3.6 circular queue

4. Linked List and Trees

4.1 Introduction

4.2 Dynamic memory allocation

4.3 Linked lists

4.4 Operations on the list

4.5 Circular linked list

4.6 Doubly - linked list

4.7 Stack as a linked list

4.8 Queue as a linked list

4.9 Tree

4.10 Binary tree terminologies

4.11 Types of binary trees

4.12 Creation of binary tree

4.13 Insertion

4.14 Deletion

4.15 Traversing a binary tree

4.16 Iterative traversing

4.17 Binary search