2,15, 8, 10, 6, 5, 4.
b. Remove key 10 from the resulting tree in (a) above.
a. How would you retrieve a key from a hashed list as above?
b. What is the complexity of insertion and retrieval?
c. Can the procedure fail to hash all the given keys into different locations? If yes then suggest a solution.
d. Assume p = 13. Apply the above procedure to the list of keys below. Show the result of the hashing method above applied to the list. 25, 81, 75, 13, 65, 72, 88.
a. Draw the Graph.
b. Show the adjacency matrix of the graph.
c. Represent the graph by the adjacency lists of it's vertices.
d. Are the lists in (c) unique?
e. Show a DFS of the graph.
f. Show a BFS of the graph.
g. Do the searches in (e) and (f) above depend on (c) above. If yes in what way?