C++Write a function void headEnqueue(Queue q, int key) which enqu.pdf
0 likes6 views
The document provides a C++ function definition for 'headenqueue' that enqueues a key at the head of a linked list-based queue while maintaining its order. It includes the definition of the 'node' structure and the 'queue' class with methods to insert elements and maintain queue integrity. The 'headenqueue' function specifically inserts a new node at the front of the queue, updating the front pointer accordingly.
1 of 2
Download to read offline
More Related Content
Similar to C++Write a function void headEnqueue(Queue q, int key) which enqu.pdf (20)
More from arjuncp10 (20)
Recently uploaded (20)
PDF
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 - GLOBAL SUCCESS - CẢ NĂM - NĂM 2024 (VOCABULARY, ...Nguyen Thanh Tu CollectionBÀI TẬP BỔ TRỢ TIẾNG ANH 8 - GLOBAL SUCCESS - CẢ NĂM - NĂM 2024 (VOCABULARY, ...Nguyen Thanh Tu Collection
C++Write a function void headEnqueue(Queue q, int key) which enqu.pdf
- 1. C++ Write a function void headEnqueue(Queue *q, int key) which enqueues the key such that, at function exit, it is positioned at the head of the queue rather than the tail; and the order and integrity of the queue is otherwise maintained. Solution struct node { int data; node* next; }; class Queue //linked_list class { private: node* front; node* rear; public: Queue(); void insert(int); headEnqueue(Queue *q, int key); }; Queue::Queue() { front = rear = NULL; } void Queue::insert(int val) { node* temp = new node; temp->data = val; temp->next = NULL; if (front == NULL) front= rear = temp;
- 2. else { node* temp1 = front; while (temp1->next) temp1 = temp1->next; temp1->next = temp; } } void Queue::headEnqueue(Queue *q, int key) { node* temp = new node; temp->data = key; temp->next=q->front; q->front=temp; }