A queue is a first-in, first-out (FIFO) data structure: the earliest element added is the first removed. It is useful for scheduling and buffering. section 1.4.3
A familiar line
Think of ordering at a Starbucks: the person who ordered first gets served first. Breadth-first tree search uses the same ordering idea to visit nodes layer by layer. section 1.4.3 section 1.4.4





























