Question 3: We use a hash table that used the following hash function to store integers: h(X)=X mod 7. Assume at each position we use an AVL tree for colision resolution.

EXTRA INFO:

NOTE: Part a), b), c), d) are all DEPENDENT of each other, the operations are done successively on the same data structure.

CSI2110/CSI 2510 Question 3. (6 points-1+1+2+1+1) We use a hash table that used the following hash function to store integers: h(X)-X mod 7, page 5 Assume at each position we use an AVL tree for colision resolution. Insert the following keys into the given data structure above showing the affected AVL tree after these operations a) put(57), put(64), put(85), put(148), put(281), put(99), put(162) and show the AVL tree b) put (155) and show the AVL tree c) remove(8) and show the AVL tree after each restructure operation. d) put(26), put(47), put(5), put (33) and show the AVL tree e) remove(40) and show the AVL tree