title: Is FIFO in a queue is equivalent to LILO?
body: <p>I am a little confused here.</p>
  
  <p>The <a href="https://www.geeksforgeeks.org/queue-data-structure/" rel="nofollow noreferrer">article</a> said:</p>
  
  <blockquote>
    <p>A Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). A good example of a queue is any queue of consumers for a resource where the consumer that came first is served first. The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we remove the item the least recently added.</p>
  </blockquote>
  
  <p>Is it right to say that FIFO (first in, first out) is the same as LILO (last in, last out)?</p>
  
  <p>And for stacks: is it the same as LIFO (last in, first out) and FILO (first in, last out)?</p>
  
  <p>But no one ever uses LILO and FILO.</p>