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

1. Data is removed at the back of the queue.
2. A friend class is made to further a sense of community among the students.
3. A tree is a recursive structure.
4. A hash function maps an object to a unique number.
5. To insert a node into a doubly linked list requires references to the node before and after the location we wish to insert the new node.

1. False
Data is serviced at the front of the queue, then removed once service is complete.
2. False.
Making class F a friend of class C is the equivalent of making every member function of F a friend of class C. The purpose is to grant to F’s member functions access to C’s private data members.
3. True
Each tree is composed of two subtrees whose root node are the nodes pointed to by leftLink and rightLink of the root node.
4. False
The number is ideally unique, but this is not guaranteed.
5. False
We only need a reference to the node either before or after the insertion point, and can use the previous or next links to get to the node on the other side of the insertion point.