T(n) = T(n/2) + T(n/4) + T(n/8) + n, then T(n) is:

B-Tree is not an acronym for Binary tree.

A ________ is very useful when data have to be stored and then retrieved in reverse order.

The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of?

If -*+abcd = 11, find a, b, c, d using the evaluation of the prefix algorithm.

Depth First Search is equivalent to which type of traversal in Binary Trees?

Which of the following problems is best solved using a greedy algorithm?

Let a_n represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for a_n?

Consider the following sequence of operations performed on a stack of size 5:

Push(1);
Pop();
Push(2);
Push(3);
Pop();
Push(4);
Pop();
Pop();
Push(5);

After the completion of all operations, the element present in the stack is?

The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of the following is the postorder traversal of the tree ?