(a) A dice is thrown n times where n is a sufficiently large enough number to...

Transcribed Image Text:

(a) A dice is thrown n times where n is a sufficiently large enough number to provide a uniformly distributed set of results. What would be the conditions for the arrangement of the result set that would trigger the worst-case scenario if the result set were inserted into a BST? (In case of equality, the new element is added to the right subtree.) (b) What would be the exact height of the tree be if the result set were inserted as such S = 6,5, 4, 3, 2, 1, 6, 5, 4, 3, 2, 1, ... ? (In case of equality, the new element is added to the right subtree.) (a) A dice is thrown n times where n is a sufficiently large enough number to provide a uniformly distributed set of results. What would be the conditions for the arrangement of the result set that would trigger the worst-case scenario if the result set were inserted into a BST? (In case of equality, the new element is added to the right subtree.) (b) What would be the exact height of the tree be if the result set were inserted as such S = 6,5, 4, 3, 2, 1, 6, 5, 4, 3, 2, 1, ... ? (In case of equality, the new element is added to the right subtree.)

Answer rating: 100% (QA)

a The worstcase scenario for the arrangement of the result set in a Binary Search Tree BST would be ... View the full answer