26.5. Summary

Try these first

1. 1.

   What is a tree in data structures?

   Hint

   Think about what a family tree represents.

2. 2.

   Name one real-world application of graphs.

   Hint

   Consider map applications.

3. 3.

   What characterizes a Binary Search Tree?

   • All nodes have two children.
   • Left nodes are smaller than the parent node.
   • Right nodes are smaller than the parent node.

   Hint

   Think about how data is sorted in BSTs.

4. 4.

   True or False: Heaps can be used to implement priority queues.

   • True
   • False

   Hint

   Consider how elements are prioritized.

5. 5.

   Design a data structure that allows you to insert elements and maintain a sorted order. Discuss how this data structure compares to a Binary Search Tree.

   Hint

   Consider how balance affects efficiency.

6. 6.

   Given a set of points in a plane, describe how you could use a graph to find the shortest path between them, touching on potential algorithms.

   Hint

   Reflect on pathfinding strategies.