PRE-READS

Heaps 1-2

Min Heap Operations 1. Insertion in a Min Heap Inserting an element in a Min Heap follows two steps: 1.…

December 12, 2024

PRE-READS

Heaps 1-1

1. What is a Heap? A Heap is a special type of binary tree where: 2. Types of Heaps Min…

December 12, 2024

PRE-READS

Tries-3

1. Time Complexity of Operations in Tries Operation Average Case Time Complexity Insertion O(m) Search O(m) Prefix Search O(m +…

December 12, 2024

PRE-READS

Tries-2

1. What is Autocomplete? Autocomplete is a common feature in applications that suggests possible completions for a partially typed word.…

December 12, 2024

PRE-READS

Tries-1

1. What is a Trie? A Trie (pronounced “try”) is a tree like data structure used to store a dynamic…

December 12, 2024

PRE-READS

Binary Search Tree 2-4

Binary Search Trees (BST) 1. What is the Inorder Predecessor? The Inorder Predecessor of a node in a BST is…

December 12, 2024

PRE-READS

Binary Search Tree 2-3

Binary Search Trees (BST) 1. What is the Inorder Successor? The Inorder Successor of a node in a BST is…

December 12, 2024

PRE-READS

Binary Search Tree 2-2

Binary Search Trees (BST) 1. What is a Balanced BST? A Balanced Binary Search Tree is a BST where the…

December 12, 2024

PRE-READS

Binary Search Tree 2-1

Binary Search Trees (BST) 1. What is the Lowest Common Ancestor (LCA)? The Lowest Common Ancestor (LCA) of two nodes…

December 12, 2024