Question 11 Given a hash table T with 25 slots that stores 1000 elements, the load...

Transcribed Image Text:

Question 11 Given a hash table T with 25 slots that stores 1000 elements, the load factor a for T is: O 80 .025 .0025 1 pts 40 Question 12 Which of traversal method of a BST produces the keys in sorted order? post-order pre-order in-order 1 pts none Question 13 The following numbers are inserted into an empty binary search tree in the given order: 11, 2, 4, 6, 16, 13, 17. What is the height of the resulting binary search tree? 02 O 4 3 1 pts O 5 Question 11 Given a hash table T with 25 slots that stores 1000 elements, the load factor a for T is: O 80 .025 .0025 1 pts 40 Question 12 Which of traversal method of a BST produces the keys in sorted order? post-order pre-order in-order 1 pts none Question 13 The following numbers are inserted into an empty binary search tree in the given order: 11, 2, 4, 6, 16, 13, 17. What is the height of the resulting binary search tree? 02 O 4 3 1 pts O 5