2013 Data Structure Homework Chapter 13, 14, 15 13.3 Show the

2013 Data Structure Homework Chapter 13, 14, 15
13.3
Show the resulting heap after each of the following alterations is made,
consecutively, to the following heap:
a.
b.
c.
d.
14.1
add (29);
add (30);
remove();
remove();
Why does the HashMap class use singly-linked lists instead of the LinkedList
class?
15.1
a.
Draw a picture of the following undirected graph:
Vertices: A, B, C, D, E
Edges:
{A, B}, {C, D}, {D, A}, {B, D}, {B, E}