Implementation of queue

[ajax-07]

Is your feature request related to a problem? Please describe.
queue data structure should be implemented for use

Describe the solution you'd like
i would like to add the full implementation of queue

Describe alternatives you've considered
i can implement queue using linked list which will dynamic in size and optimized

please assign me

[nikhilgang]

class Queue {
public:
stack s;

// Push element x to the back of queue.
void push(int x) {
    pushHelper(x);
}
void pushHelper(int x){
    if(s.size()==0){
        s.push(x);
        return;
    }
    int data;
    data = s.top();
    s.pop();
    pushHelper(x);
    s.push(data);
    return;
    
}

// Removes the element from in front of queue.
void pop(void) {
    s.pop();
}

// Get the front element.
int peek(void) {
    return s.top();
}

// Return whether the queue is empty.
bool empty(void) {
    return (s.size()==0);
}

};

[ajax-07]

this is not the scratch implementation of queue you are using stack to implement queue
.....
.

[Shiv2708]

Hello can you assign me this issue
where do we have to add this

[ajax-07]

yes if you think you can do it then proceed with this issue.