B+ trees are preferred to binary trees in databases because

Which of the following pairs of traversals is not sufficient to build a binary tree from the given traversals?

While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is

What are the worst-case complexities of insertion and deletion of a key in a binary search tree?

Which of the following traversal outputs the data in sorted order in a BST?

Consider a node X in a Binary Tree. Given that X has two children, let Y be Inorder successor of X. Which of the following is true about Y?

The number of structurally different possible binary trees with 4 nodes is

Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height x is:

The maximum number of binary trees that can be formed with three unlabeled nodes is:

What does the following function do for a given Linked List with first node as head?

void XYZ(struct node* head)

{

if(head == NULL)

return;

XYZ(head->next);

printf("%d  ", head->data);

}

Which of these is an application of linked lists?

Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

What is the time complexity of searching for an element in a circular linked list?

Which of the following points is/are true about Linked List data structure when it is compared with array?