Implementation of Queue in Python:
Step 1) Create a Queue class and a constructor that initializes the object with front and rear as null
because initially the queue is empty.
Step 2)Create a Node class with 2 members: data and next
reference. Whenever we want to enqueue an item we will first create a Node and then assign it inside the queue.
Step 3) Enqueue(1) will enqueue the item in the queue. First, check whether the queue is empty using if self.rear==None
. If true, assign the temp node as temp = Node(data) and then assign the rear and front as temp.
If false, it means queue is not empty so perform these two steps:
1) Assign self.rear.next = temp which enqueues the temp node to the next of rear node.
2) Reassign self.rear = temp
🔗Important Links:
Data Structures in Python: • Data Structures in Python
🌐Join our community:
Android App(Notes+Videos): https://play.google.com/store/apps/de... Facebook: / thinkxacademy Twitter: / thinkxacademy Instagram: / thinkxacademy
#queue #python #dsa
On this page of the site you can watch the video online [4.2] Create Queue and Node Class | Data Structures in Python with a duration of hours minute second in good quality, which was uploaded by the user ThinkX Academy 15 December 2020, share the link with friends and acquaintances, this video has already been watched 1,381 times on youtube and it was liked by 14 viewers. Enjoy your viewing!