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
In questa pagina del sito puoi guardare il video online [4.2] Create Queue and Node Class | Data Structures in Python della durata di ore minuti seconda in buona qualità , che l'utente ha caricato ThinkX Academy 15 dicembre 2020, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 1,381 volte e gli è piaciuto 14 spettatori. Buona visione!