Hashing, Trees, and Search

Explain hash functions, collision resolution strategies (chaining, open addressing), and their trade-offs.

Implement a hash table with collision resolution to support efficient lookups, insertions, and deletions.

Implement a binary tree with recursive traversal algorithms (in-order, pre-order, post-order).

Implement a Binary Search Tree with insert, search, and delete operations.

Analyze the time complexity of BST operations in balanced vs. unbalanced scenarios.

Explain the rebalancing mechanism of an AVL or Red-Black tree using rotations.

Implement level-order traversal for a binary tree using a queue.

Apply a hash table or a BST to solve a problem, justifying the choice of data structure.