$1-1$ What is the maximum and minimum number of leaf nodes of a complete binary tree of height $5?$ Answer the same question for a complete binary tree of height $k.$

$($FIB$)$

$1-2$ Assume that a max heap with $20$ nodes is represented sequentially using an array $T$ as explained in class. Where is the largest number in $T?$ What is the range of indexes where the smallest number may reside?

$($FIB$)$

$1-3$ On a binary search tree, what will happen if the root is deleted? Which node will become the new root?

$($ANS$)$

$1-4$ Given the inorder and preorder traversal results, we can always construct a unique binary tree.

$($True$/$False$)$