What is the time complexity of Merge Sort?

Out of 4 distinct keys, how many distinct binary search trees can be created?

Evaluate the infix expression: a + b * c - d / e^f, where a = 5, b = 3, c = 6, d = 8, e = 2, and f = 3.

What is the average case time complexity for finding the height of a binary tree?

Which of the following algorithms can be used to find any path from a source to a goal?

What is the correct statement about additive cipher?

Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth First Search of G? Assume that the graph is represented using adjacency matrix.

What is the return value of the following function for the array arr = {7, 13, 3, 1, 3, 3, 10, 7, 13, 10, 7, 1, 3} and n is the size of this array?

int fun(int arr[], int n)
{
   int x = arr[0];
   for (int i = 1; i < n; i++)
       x = x ^ arr[i];
   return x;
}

B+ Trees are considered BALANCED because

What is the definition of a complete binary tree?