Deep Dive Digital Notes
DSA
DEEP DIVE NOTES
NOTES
150+ Pages
Store.CodeWithCurious.com
For More Coding Books & Handwritten Notes © 2024 All Rights Reserved CodeWithCurious
INDEX
SR NO. CHAPTERS PAGE NO.
1 CHAPTER 1 INTRODUCTION 5
1.1 Operations on Data Structure
1.2 Complexity
1.3 Dynamic Memory Allocations
1.4 Arrays
1.5 Traversing Linear Array
1.6 Multidimensional Array
2 CHAPTER 2 Searching and Sorting Technique 30
2.1 Searching
2.2 Hashing
2.3 Sorting
2.4 Sorting Techniques
3 CHAPTER 3 Stack ,Queues &Recursion 56
3.1 Stacks
3.2 Polish Notations
3.3 Recursion
3.4 Tower of Hanoi
3.5 Queues
4 CHAPTER 4 Linked Lists 77
4.1 Introduction
4.2 Creating List
4.3 Memory Allocations
4.4 Inserting in Linked List
4.5 Header Linked List
5 CHAPTER 5 Trees 98
5.1 Trees Terminologies
5.2 Trees Types
5.3 Binary Trees Traversal Method
5.4 Binary Trees Operation
5.5 Heap
6 CHAPTER 6 Graphs 129
6.1 Introduction
6.2 Linear Representation of Graph
6.3 Warshall's Algorithm
6.4 Applications of Graph