Question

Canvas → XCO Question 4 5 pts When using a hash table with quadratic probing, and the table size is prime, then a new element can always be inserted if the table is at least half empty the table is at least half full the table is full the table is larger than any data value Question 5 5 pts The general strategy of inorder traversal is: process the left subtree, then process the current node and finally process the right subtree process the current node, then process the left subtree and finally process the right subtree process the left subtree, then process the right subtree, and finally process the current node none of the above Question 6 5 pts In a min-heap of N elements, if we want to find the max element, we have to search all the leaves. What is the big-O running time of findMax? ON 2) ON logN OdlogN ON

Answer 1

`Hey,

Note: If you have any queries related to the answer please do comment. I would be very happy to resolve all your queries.

4) OPTION B IS CORRECT

5) OPTION A IS CORRECT

6) OPTION D IS CORRECT

Kindly revert for any queries

Thanks.