Question $1$

Select all of the statements that are true regarding the structure of an Array List.

$$ All of the elements are of the same type.

$$ The heights of the two child sub$-$trees of any node can differ by at most one.

$$ All of the elements are located contiguously in memory.

$$ It uses a hash function to compute an index into an array of buckets or slots, from which the

desired value can be found or stored.

$$ The key at the root node has the minimum key value among all nodes.

$$ The values are stored and removed to satisfy the property that an element with high priority is

served before an element with low priority.

$$ It is a linear ordered collection of values called elements.

$$ The last node in the sequence contains a pointer $($or reference$)$ to the first node in the sequence.

$$ Each node has an extra bit of data that is used to ensure the structure remains approximately