data structures

What is the maximum possible number of nodes in AVL tree of height 3 ? Assume that the height of a tree with a single node is 0. O 16 O 8 07 0 15 You are given an empty hash table of size 7 that uses open addressing. The following sequence of keys is to be inserted: 4 7 8 23 3 17 8 using h(x) = x % 7 and quadratic probing. Element 17 is going to be assigned to index: 03 O 4 O 5 06 Which of the following applications makes use of a circular singly linked list? O Calculating the value of the postfix expression O Undo operation in a text editor O Recursive function calls O In multiplayer board games where the rotation is performed