You can create instances of Color by mixing red, green, and blue hues in various proportions.

Answer the following statements true (T) or false (F)

1. If an attempt is made to use pop on an empty stack, an error should occur. 2. In a queue, elements are inserted and removed from the same end. 3. In a binary tree, each node may have links to any number of subtrees. 4. The key of every node in a binary search tree must be larger than every key of every node in its left subtree and smaller than every key of every node in its right subtree. 5. Searching a binary search tree is an O(n/2) process.

In the array implementation, under what circumstances could the rear reference equal 0?

What will be an ideal response?