Priority queues can also be used to simulate a FIFO queue. How might you use a PQ as a FIFO queue? In Chapter 9, we described the graph data structure. A depth-first traversal of a graph uses a stack, and a breadth-first traversal of a graph uses a FIFO queue. Can you explain why? Walk through your kitchen and list the number of items that include embedded computers.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here