Aryan PrajapatKnowledge Contributor
What are different operations available in queue data structure?
What are different operations available in queue data structure?
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Questions | Answers | Discussions | Knowledge sharing | Communities & more.
enqueue: This adds an element to the rear end of the queue. Overflow conditions occur if the queue is full.
dequeue: This removes an element from the front end of the queue. Underflow conditions occur if the queue is empty.
isEmpty: This returns true if the queue is empty or else false.
rear: This returns the rear end element without removing it.
front: This returns the front-end element without removing it.
size: This returns the size of the queue.