Q4. Provide your brief and precise answers for the following:

Do not paste image write in the given area

a. Why Binary Search is not preferred to be used on linked list data structure?

Click or tap here to enter text.

b. Which sorting algorithm would be best for an air-traffic control program where thousands of flights must be sorted quickly, and slow sorting should never occur? Why?

Click or tap here to enter text.

c. To determine if two binary search trees are identical trees, one could perform an in-order tree walk on both and compare the output lists. Is this True or False? Explain.

Click or tap here to enter text.

d. What happens if a queue is implemented using a linked list? What will be the time complexity of Enqueue and Dequeue operations using linked list?

Click or tap here to enter text.

e. What will the Time Complexity of stack Push and pop operations when it is implemented on a Linked List? Compare it with array-based stack in terms of performance.

Click or tap here to enter text.

f. Why the minimum element in a Binary Search Tree cannot have a left child? You can use the following BST to justify your answer.

Click or tap here to enter text.

g. Suppose that we first insert an element x into a binary search tree that does not already contain x. Then we immediately delete x from the tree. Will the new tree be identical to the original one? If yes give the reason in no more than 3 sentences. If no give a counter example. [3 Marks]

Click or tap here to enter text.