Try this exercise. Is this statement true or false?
The advantages to using a hash table to represent an adjacency list include 1) O(1) insert and delete complexity on average, 2) a vertex can be modeled by any hashable object, and 3) more space-efficiency for sparse graphs.
Press true if you believe the statement is correct, or false otherwise.
