Home/ Questions/Q 775927
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-14T19:22:10+00:00

I know how the push() and pop() methods in a typical implementation of a

  • 0

I know how the push() and pop() methods in a typical implementation of a Queue/Linked List work but what I do want to know is what you actually define as a push or a pop? When can you name a method push()/pop()? What makes the insert()/add() method in a typical Tree implementation not a push()?

My understanding is that push()ing means putting something to a position some special pointer is pointing to, and pop()ping an element means putting some object away some pointer is pointing to, but it doesn’t seem to be clearly defined. Or does the naming matter at all?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    When referring to operations on a linked list, you can push items on to the list to add them. You can then pop items off of a list to remove them.

    If you pop items from the same end of the list that you add them, you have implemented a stack, or a Last-In-First-Out (LIFO) data structure:

    Stack

    If you pop items from the opposite end, then you have implemented a queue – although usually the terminology is “enqueue” and “dequeue”. This is a First-In-First-Out (FIFO) data structure:

    Queue

    • 0