PRE-READS

BFS and DFS 1-2

BFS Applications and Time Complexity 1. BFS Applications BFS is widely used for solving various graph-related problems. Some common applications…

December 12, 2024

PRE-READS

BFS and DFS 1-1

BreadthFirst Search (BFS) 1. Introduction to BFS BreadthFirst Search (BFS) is a graph traversal algorithm that explores all nodes level…

December 12, 2024

PRE-READS

Heaps 3-1

1. Merging K Sorted Lists Using Heaps Given `K` sorted linked lists, the task is to merge them into one…

December 12, 2024

PRE-READS

Heaps 2-4

Pseudocode for Heap Sort Algorithm: // Heap Sort Algorithm // 1. Heapify Function: Ensures the Max Heap property so the…

December 12, 2024

PRE-READS

Heaps 2-3

1. What is Heap Sort? Heap Sort is a comparison based sorting algorithm that uses a binary heap to sort…

December 12, 2024

PRE-READS

Heaps 2-2

1. Insert Operation in a Priority Queue When an element is inserted into a priority queue using a heap: The…

December 12, 2024

PRE-READS

Heaps 2-1

Heaps 1. What is a Priority Queue? A Priority Queue is a data structure where each element has a priority.…

December 12, 2024

PRE-READS

Heaps 1-4

Heapify and Build Heap 1. Heapify Process Heapify is the process of converting a binary tree into a heap. It…

December 12, 2024

PRE-READS

Heaps 1-3

Max Heap Operations 1. Insertion in a Max Heap The process of insertion in a Max Heap is similar to…

December 12, 2024