In an AVL tree, if the balance factor of a node is -1, which of the following statement/s is/are true?

Which statement is true for a B-tree?

What is the minimum number of nodes in a full binary tree with height 3?

Which of these is the correct big -Oh expression for 1+2+3+...+n?

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

What should be added in place of "/*ADD A STATEMENT HERE*/", so that the function correctly reverses a linked list.

You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion into a NONEMPTY queue?

Which of the following techniques is used to resolve collision in hashing?

The number of nodes in the largest maximal independent set of the complete bipartite graph K(4,2) is_____ .

What kind of initialization needs to be done for a chained hash table?

Which queue allows insertion and deletion at both ends?