Which of the following is true about linked list implementation of queue?

Your answer:

In push operation, if new nodes are inserted at the beginning, then in pop operation, nodes must be removed from the beginning

In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from beginning

In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from end

In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end

Clear answer