Since Tyler couldn't make it today, I will be explaining our new topic, Data Structures.There are 4 types of Data Structures:
QueuesBinary Search Trees
Let's take this example:
In Stacks and Queues, You'll see the methods PUSH and POP. PUSH inserts an item into the stack/queue. POP has different effects based on whether it's a Stack or a Queue.
When using POP, Stacks uses the rule "First in, Last out." This signifies that POP would take out the most recent item inserted. For example, the first POP in this stack would remove R from the stack.
On the other hand, Queues use the rule "First in, First out." This signifies that POP would take out the thing in the first "slot." In this case, the first POP in the above queue would remove F, unlike the R it would remove if it was a Stack.