Which one of the following balance factor, a node in AVL tree cannot have?

What is the time complexity of raising a number a to the power b?

What is the time complexity of matrix multiplication using the Divide and Conquer method?

The approach adopted to solve the quick hull problem is:

What is the time complexity to insert an element at the front of a linked list (where the head is known)?

The average number of key comparisons required for a successful search using sequential search on a list of n items is

Which of the following approaches can be used to solve the sum of subsets problem?

Consider a B-tree of order 4 that is built from scratch by 10 successive insertions. What is the maximum number of node splitting operations that can occur?

A string matching algorithm is a technique used to find a pattern or substring within a larger text or string.

Consider the following code snippet:

void recursive_function()
{
  recursive_function();
}
int main()
{
  recursive_function();
  return 0;
}

What will happen when the above code is executed?