Today, I’ll cover the queue, which is a linear data structure. The workings of the queue are very intuitive and easy to understand, as it works just as a regular queue (i.e. in the grocery store).
Unlike stacks, which follow the LIFO principle (Last In, First Out), a queue follows the FIFO principle (First In, First Out). In other words, "In a queue data structure, we remove the least recently inserted item."
from DZone.com Feed https://ift.tt/2C5UGaH
No comments:
Post a Comment