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

1) In a queue, the first item to be added is the last item to be removed.
2) Trees can have no more than two child nodes per node.
3) A tree node with no children is called a leaf node.
4) Linked-list nodes are stored contiguously in memory.
5) The primary operations of the stack data structure are enqueue and dequeue.
6) Lists, stacks and queues are linear data structures.

1) False. A queue is a first-in, first-out data structure—the first item added is the first
item removed.
2) False. In general, trees may have as many child nodes per node as is necessary. Only
binary trees are restricted to no more than two child nodes per node.
3) True.
4) False. Linked-list nodes are logically contiguous, but they need not be stored in a
physically contiguous memory space.
5) False. Those are the primary operations of a queue. The primary operations of a stack
are push and pop.
6) True