#13 Queue Implementation using Java Part 1 | EnQueue

Published: 02 January 2018
on channel: Telusko

227,334

2.5k

Complete playlist of Data Structure Using Java : https://goo.gl/3eQAYB

Queue is a First-In-First-Out (FIFO) data structure.
In Queue the first element added to the queue will be the first one to be removed.
This is equivalent to the requirement that once a new element is added, all elements that were added before have to be removed before the new element can be removed.
Adding element in Queue is called EnQueue and removing element is called DeQueue.
Often a peek or front operation is also entered, returning the value of the front element without dequeuing it.

In this video we will see :
What is Queue
EnQueue
DeQueue
Insert
Remove
Size
isEmpty
What is Front
What is Rear
Implement Queue operation- EnQueue with array

Check out our courses:

AI Powered DevOps with AWS - Live Course :- https://go.telusko.com/AIDevOps-AWS
Coupon: TELUSKO10 (10% Discount)

Complete Java Developer Course Batch-4: https://go.telusko.com/Complete4
Coupon: TELUSKO10 (10% Discount)

Master Java Spring Development : https://go.telusko.com/masterjava
Coupon: TELUSKO20 (20% Discount)

Check out our website: http://www.telusko.com

Donation:
PayPal Id : navinreddy20
Patreon : navinreddy20
http://www.telusko.com/contactus

On this page of the site you can watch the video online #13 Queue Implementation using Java Part 1 | EnQueue with a duration of hours minute second in good quality, which was uploaded by the user Telusko 02 January 2018, share the link with friends and acquaintances, this video has already been watched 227,334 times on youtube and it was liked by 2.5 thousand viewers. Enjoy your viewing!

363,581

4.8K