1.9. Advanced Data Structures

Try these first

1. 1.

   Define a binary tree.

   Hint

   Think about the maximum number of connections a single node can have.

2. 2.

   What is a hash table?

   Hint

   Consider how data is indexed for quick retrieval.

3. 3.

   What property does an AVL tree maintain?

   • Balanced tree height
   • Node color
   • Sorted order

   Hint

   Think about what characteristics a self-balancing tree must have.

4. 4.

   True or False: A min heap allows access to the highest priority element.

   • True
   • False

   Hint

   Consider which element is prioritized in a min heap.

5. 5.

   Design a hash table to store student records by their student IDs. Discuss how you would handle potential collisions.

   Hint

   Consider methods of resolving hash collisions.

6. 6.

   Develop an algorithm for inserting a new value into an AVL tree. Describe necessary rotations.

   Hint

   Think about how heights of subtrees influence rotations.