C. The only difference between a depth-first traversal of a graph and a breadt-f instead of a queue to manage the traversal. traversal is the use of a a. Stack b. Tree c. List d. Heap D. What is the principle difference in behavior between a stack and a queue? a. a stack reverses order whereas a queue preserves order b. a stack does nothing whereas a queue can preserve and reverse order c. there is no difference d. a stack preserves order whereas a queue reverses order E. When an element is removed from a queue using the dequeue operation, that element is removed from the of the queue. a. Front b. Rear c. Middle d. None of the above A circular array implementation of a queue is more efficient than a fixed array implementation of a queue because elements never have to be F. a added b. removed c. shifted d. initialized G. Lists can be categorized as , or a. Ordered, unordered, indexed b. Linked, array, interface c. Double, single, array d. None of the above H. Trees are useful for representing structures. a. Linear b. Circular c. Last in first out d. Hierarchical e. None of these