Consider a hash table $P[0,1, \ldots, 10]$ that is initially empty. The hash table is maintained using open addressing with linear probing. The hash function used is $h(x)=(x+7) \bmod 11$. Consider the following sequence of insertions performed on $P$ :

$$ 1,13,22,15,11,24 $$

Which of the following positions in the hash table is/are empty after these insertions are performed?

The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible height of a full binary tree with 23 nodes is $\_\_\_\_$ . (answer in integer)

Consider the following code snippet in C language that computes the number of nodes in a non-empty singly linked list pointed to by the pointer variable head.

struct node{

    int elt;

    struct node *next;

};

int getListSize (struct node *head)

{

    if( E1 ) return 1;

    return E2;

}

Which one of the following options gives the correct replacements for the expressions E 1 and E 2 ?

Let $P$ be the set of all integers from 1 to 15 . Consider any order of insertion of the elements of $P$ into a binary search tree that creates a complete binary tree. Which one of the following elements can NEVER be the third element that is inserted?