PRACTICE PAPER

Question

CONSIDER THREE STATEMENTS WITH RESPECT TO SOME TYPE OF TREE

S1:FINDING SMALLEST ELEMENTS.

S2:FINDING ELEMENT x WHICH IS ALREADY AVAILABLE

S3:FINDING ELEMENT x WHICH IS NOT THERE

WHICH OF THE FOLLOWING IS TRUE

A)S1 USING BINARY SEARCH TREE IN WORST CASE WILL TAKE O(N) WHILE USING BINARY TREE WILL TAKE  O(LOG N)

B)S2 USING BST IN WORST CASE WILL TAKE  O(LOG N) AND S3 USING BST IN WORST CASE WILL TAKE O(N).

C)S3 IN BEST CASE CAN BE SOLVE USING MIN HEAP IN CONSTANT TIME.

D)S1 USING AVL TREE IN BEST CASE WILL TAKE O(1) AND S2 USING AVL TREE IN BEST CASE WILL TAKE  O(LOG N)