• recategorized by
229 views

1 Answer

0 0 votes

Enqueue is generally used interchangably for  insertion in the queue from the rear.

Dequeue is genereally told when a Queue removes an element present in  its front pointer.

Push is the term usually used in Stacks for mentioning insertion of an element in Stack

Pop is the term used to remove the top most element present in the Stack.

So the option A is correct.

Answer:
Position:
Show:

Related questions

1 1 vote
0 0 answers
229
229 views
Shubham Sharma 2 asked Jul 24, 2025
229 views
Which of the following is the primary property of a binary heap?The parent node is greater than its children (max-heap).The parent node is less than its children (min-hea...
3 3 votes
1 1 answer
218
218 views
Shubham Sharma 2 asked Jul 24, 2025
218 views
Which of the following operations can be performed in $\mathrm{O}(\log n)$ time in a binary heap?Deleting the root elementInserting an elementBoth $\text{(A)}$ and $\text...
1 1 vote
0 0 answers
146
146 views
Shubham Sharma 2 asked Jul 24, 2025
146 views
What is the time complexity for searching an element in a balanced Binary Search Tree?$\text{O}(1)$$\text{O}(\log n)$$\text{O}(n)$$\text{O}(n \log n)$ 
2 2 votes
1 1 answer
202
202 views
Shubham Sharma 2 asked Jul 24, 2025
202 views
Which traversal method can be used to print the nodes of a binary tree in ascending order?Pre-order traversalPost-order traversalIn-order traversalLevel-order traversal