int count() { if(rear==-1 && front==-1) return 0; else return rear-front+1; } count should be like this otherwise without element also count will be 1. Well thank you sir
Thats really great to know buddy🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
bhai, apke is channel ko to 1Milllion subcribers hona chaiye, itne acche aur satik tareeke se koi DS padha v skta h, vishwas nhi ho rha h!!!!!!!!...m apka bhot bhot abhari hu, jo apne itne jatil vishayon ko v itne saral aur graphics se zariye itna accha banaya ki hm ubte tk nhi!!!!!please ap CS k baaki subjects ko v graphics k zariye padhaeyega (but free m, bhai :)), taki humara bhala ho....apko ishwar sada sukhi rakhe...... -Apka ek subscriber....
Thank you Samarth, aapka ye comment padhke bohot acha laga and motivation mila aur aise educational videos bananke liye. And ha aur bohot saare educational videos ye channel par upload hoti rahegi bilkul FREE. Please aap ye channel and videos aapke dosto main share karey. Yehi bada support rahega 🙏
Hey Guys, if you want more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends as it helps me create more content just for you ✌
if(rear==-1 && front==-1) return 0; else return rear-front+1; for printing elements we can use this rather than printing those deleted 0's :) Thank You sir!
You are the best when I think of clear and excellent explanation on TH-cam! Thank you for making these videos, and I will always support you by sharing your channel with my friends and mentees!
Thank you so much Albert. Because of you and such amazing support from you I get motivated to make more such free & high quality educational for all of you👍❤️
Your explanation is mind blowing. Through your videos i get to learn things in a single shot! I have one request - can you please make a video on linked list implementation of stacks and queues.
Hello Manan, thank you so much for such a positive feedback. I am glad to hear that these videos are easy to understand for you. Please do share these videos and our channel with your friends too. Thats the biggest help and support. And talking about your request, yes I will cover this topic soon so hope you have subscribed and turned on the notifications ✌
Hehehe thank you so much Sharvari 🙏 this was a great comment 😬 please do share this channel so that others also find this oasis 😉😊 Hope you are staying home & safe. Tc ✌️
Awesome!!! DS and algo was never so easy for me.....I was always scared of these....But the way you explain things makes them seem so easy and fun!! Thank you so much dude for the great work! :) I've also recommended this channel to many people...And then they even thanked me for the recommendation and told how your channel saved them! xD xD xD
keep it more simple @simple snippets #include using namespace std; int rear,front; int arr[5];int value; class queue { int front,rear; public: queue() { front=-1, rear=-1; for(int i=0;i
Thanks amazing Yashwardhan. Glad to hear this. I hope you have subscribed to this channel & please share this video with your friends too. That will be the biggest help & support 😇
Here is the change() function, if anyone is wondering how to implement it. I have tried to make it dynamic, but we can make our own adjustments. Code: void change() { int x = front; int y = rear; int z; if(isEmpty()) { cout
Best explanation but in the count function it is (rear - front +1 ) but if both the rear and count are at -1 and -1 the count should be zero but it is 1..
Edit the code like this: int count() { if(front == -1 && rear == -1) return (rear-front); else return (rear-front+1); } Then your problem will be solved.
for the problem at the end when you remove items from the front of list, why can't you shift every item left one space so that your new front item will be at index 0; then the rear would be decremented by 1. Therefore, your rear==4 will return false because now is rear==3
When we dequeue all the elements how the rear and front go to -1 as there is no change in rear in the else part of the dequeue function. Whenever i dequeue all the elements i can not enter new elements in the queue so the queue becomes useless. Can you help me?
If you add 3 element in the quee and then dénuée the first element you will have something like 0 56 34 0 0 and if you call the count function it will execute rear-front +1 which is =-1-(-1)+1=1 ;which is wrong because you still have 2 element not one so to fix this you can initialize int itemsnumber. to 0 and do for (int i=0;I
I have just used rear variable for the implementation I run in for loop I just make arr[rear]=0 and than decrement the rear In dequeue operation....it is correct? Else we must use the two variable to implement the queue operation
You are saving my 3rd semester. 🙈 🙈 Thanks a lot. 👍 Please make some videos on graphs also.... I guess I didn't find them in Data Structure's play list....
When we carry dequeue operation, should the elements shieft by one index towards the element which was dequeued? Like we have five elements 10 20 30 40 50. And we carried dequeue Then 10 gets dequeued And the new sequence should be 20 30 40 50 0 Right?
why do we use return in enqueue function in if(isFull()) where as enqueue function type is void and does not return any type. please help me understand it.
Nice code but if someone insert 0 in the queue and display it then the output will be just zeros and it may become confusing at that index whether element is inserted or is it empty position. While displaying 0 should be converted to null.
When we create methods it is in the responsibility of the user (programmer) to make good use of those methods. For example, since you implemented the isEmpty() and isFull() methods, it is better to use them (in main method) before calling the enqueue and dequeue and not use them inside methods. example in class ///////////////////////////////////////////////////////////// void enqueue(int val) { if(front == -1) ++front; arr[++rear] = val; } ///////////////////////////////////////////////////////////// int dequeue() { int val = arr[front]; arr[front] = 0; if(front == rear) front = rear = -1; else ++front; return val; } ////////////////////////////////////////////////////////////// in main() case 1: cout > value; if(!q.isFull()) q.enqueue(value); else cout
That's great to know buddy, please do Subscribe to our channel as we have a lot tech educational content which you'll surely like. Also please do share our channel and videos with your friends too, that's the biggest help and support you can provide buddy ✌
Can you please upload vedios on What is doubly ended Queue (Dqueue) and it's c++ implementation using linked list representation C++ implementation of Queue using circular linked list C++ implementation of Stack using linked list
That will only work correctly if you have not dequeued anything. Once you dequeue an the front idex moves from zero, (rear + 1) will give you a count that is more that what is in the queue
Shouldn’t we advance the entire queue by one position when dequeue() method is invoked? That will make room for one more element in the queue to be added.
bool isFull() { if(rear==4 && front==0) return true; else return false; } If statement should be like that coz, after fully filling the array and doing dequeue... The front increases but not rear ... & Thus it's not actually full, still it shows FULL .. coz front = 1 and rear = 4 ... So in if statement, both conditions should be checked !!
There is mistake in count function also...if we does not enqueue any value....count must be 0 but this will show 1 because in that case rear and front both are -1 and -1-1+1 is 1.....so put this case also in count function when front and rear are -1
Is there an option to replace 0 with null because if someone enqueue 0 then it will be confusing right. When he uses display function then it will show the empty ones which is 0 and his 0. So how to solve that issue.
Sir you are initializing the array indices with 0..... What if we want to add 0 in the queue it might be confusing that index has some value or is it empty?
So, I had a quick question. When is a queue full? I understood all the concepts and your video was AWESOME (as always haha)... but not being able to define if the queue was full or not made me think what a queue being full meant? I'd appreciate if you could let me know. Thanks and like you always say... Peace
I didnt really get your question here. A queue is full when all the values in it are occupied. A simple queue also has one drawback when a queue is dequeued the front pointer moves one position ahead essentially reducing the size of the queue by 1 because the front of the queue has to be removed off so we do it by dereferencing(meaning the front pointer no longer points to it). This creates an issue where some space from the start gets wasted after every dequeue. Hence we have circular queue as well to tackle this issue. Check the circular queue video I think you will understand much better what I am trying to explain here ✌
@@SimpleSnippets so my question is why we cannot define the is_full() func like this for a linear queue? isFull() { if(f==0 and r == (size(arr)-1)) return true; else return false; } in the isFull() function?
@@dibbyabarua9499 because we just can't add further entries because the last value is present so as to deal with this exception we checked the rear end as size-1. This can be solved with dequeue
sir you told about 1 drawback of a simple queue is that isFull() couldn't give the correct and when some elements were dequeued but I coded it like this which gives true only when a queue is full otherwise not bool is_Full(){ if(last-head==4) return true; else return false; } please inform if it is wrong
int count(){ if(rear == -1 && front == -1){ return 0; } else{ return (rear-front+1); } } I wrote this as count function and it is not working! can someone help?
You made a mistake for dequeue method at else if (front == rear). arr[front] should set to 0 after dequeuing. See * below. int dequeue(){ int x; if (isEmpty()){ cout
int count()
{
if(rear==-1 && front==-1)
return 0;
else
return rear-front+1;
}
count should be like this otherwise without element also count will be 1.
Well thank you sir
Yes this seems correct. I will pin your comment Shubham, thank you for pointing this out ✌
I checked if(isEmpty()) :3
else
is not required actually ...
~~
if (rear==-1 && front==-1)
return 0;
return rear-front+1;
This one ...
@Jermaine Randall u both r everywhere so i m reporting u
I also came here in the comments box to tell this issue
At 14:07 it gives count 1 even if the queue is empty
That's why first we have to check for isEmpty and return 0 if isEmpty is true.
Today my search ends here about QUEUE...
best explanation...
!!! thanks !!!
Thanks bro 😬 I'm glad you liked it ✌️ also please do share it with your friends bro 😊
Love You Bruh. I'm in 3rd semester and studying Data Structures. Its Going Outstanding.
Thats really great to know buddy🙏 Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
foundation uni?
@@minahilxbts5925 may be fast uni faisalabad campus
@@KingKhan-lt4mn not fast because we have 6 digits after the branch character, just like mine
Same to you
Man; this is the best explanation I have ever heard in a TH-cam video
Hehe thanks bro🤟 please do share the video with your friends too 😊
@@SimpleSnippets sure
bhai, apke is channel ko to 1Milllion subcribers hona chaiye, itne acche aur satik tareeke se koi DS padha v skta h, vishwas nhi ho rha h!!!!!!!!...m apka bhot bhot abhari hu, jo apne itne jatil vishayon ko v itne saral aur graphics se zariye itna accha banaya ki hm ubte tk nhi!!!!!please ap CS k baaki subjects ko v graphics k zariye padhaeyega (but free m, bhai :)), taki humara bhala ho....apko ishwar sada sukhi rakhe......
-Apka ek subscriber....
Thank you Samarth, aapka ye comment padhke bohot acha laga and motivation mila aur aise educational videos bananke liye. And ha aur bohot saare educational videos ye channel par upload hoti rahegi bilkul FREE. Please aap ye channel and videos aapke dosto main share karey. Yehi bada support rahega 🙏
BEST DSA course ever on youtube love the way you teach!
Rigorous explanation.
I am satisfied.
Thank you, Tanmay Sakpal.
So nice of you
Hey Guys, if you want more such tech educational videos on this channel then please support me by subscribing to this channel & also share it with your friends as it helps me create more content just for you ✌
Your series has been a blessing to me and my life. May God bless you.
if(rear==-1 && front==-1)
return 0;
else
return rear-front+1;
for printing elements we can use this rather than printing those deleted 0's :)
Thank You sir!
You are the best when I think of clear and excellent explanation on TH-cam! Thank you for making these videos, and I will always support you by sharing your channel with my friends and mentees!
Thank you so much Albert. Because of you and such amazing support from you I get motivated to make more such free & high quality educational for all of you👍❤️
@@SimpleSnippets 💖
My always go to channel for my degree is justtt simple snippets alwaysss..... Thank you brother💁🏻♀️
Hand down! This is one of the best explanation on DS
Thanks bro 🤘
Way of teaching ufffff kirrakkk hai
bro u are op wish u were getted me at the time of diploma till now i was be at the intermediate level of programmer
Your contents are amazing💖. I'm thankful to you from my heart❤❤
Your explanation is mind blowing. Through your videos i get to learn things in a single shot!
I have one request - can you please make a video on linked list implementation of stacks and queues.
Hello Manan, thank you so much for such a positive feedback. I am glad to hear that these videos are easy to understand for you. Please do share these videos and our channel with your friends too. Thats the biggest help and support. And talking about your request, yes I will cover this topic soon so hope you have subscribed and turned on the notifications ✌
@@SimpleSnippets please make as soon as possible on stack implement using linklist
Your channel is like finding an oasis in Sahara Desert..... Thanks for the great explanation and endless effort !!!
Hehehe thank you so much Sharvari 🙏 this was a great comment 😬 please do share this channel so that others also find this oasis 😉😊
Hope you are staying home & safe. Tc ✌️
@@SimpleSnippets I hope you too are safe and sound at home. 😇
22:10 Drawback of "queue"
Simply a perfect channel for perfect programming!!! 👊 thanks alot brother❤️
Glad you enjoy it! Please support me by sharing the videos and our channel with your friends too. Thats the biggest help and support you can provide 😇
@@SimpleSnippets sure brother! 👊
Awesome!!! DS and algo was never so easy for me.....I was always scared of these....But the way you explain things makes them seem so easy and fun!! Thank you so much dude for the great work! :)
I've also recommended this channel to many people...And then they even thanked me for the recommendation and told how your channel saved them! xD xD xD
I'm so glad! Thanks Ankita, means a lot 😇🙏
keep it more simple @simple snippets
#include
using namespace std;
int rear,front; int arr[5];int value;
class queue
{ int front,rear;
public:
queue()
{
front=-1, rear=-1;
for(int i=0;i
Thanks for the display function
its a lot easier , thanks
Queue Concept and its operations are now clear,thanks Tanmay Bhai 😍👍👍🙌🙌
Great Explanation!!
Minor bug fixes:
bool isFull()
{
if (r-f == size-1)
{
return true;
}
else
{
return false;
}
}
int count()
{
if (r == -1 && f == -1)
{
return 0;
}
else
{
return (r - f) + 1;
}
}
Awesome!!!! Understood everything..
Thanks.
Thanks amazing Yashwardhan. Glad to hear this. I hope you have subscribed to this channel & please share this video with your friends too. That will be the biggest help & support 😇
I think this is better approach to display the queue
void display(){
if(isEmpty()){
cout
Best DSA explanation man
Glad you think so!
Bro your way of speaking and fluency in English is wonderful...👍👌👏👏
Thank you so much Sandeep. This is such a great compliment. Hope the video was good and easy to understand as well ?
@@SimpleSnippets the video was wonderful bro...keep making such videos help us...👍👍👌...
Following you since 20k subscribers you had ❤️
Wow that's amazing to know buddy ✌️ grateful for your support always 👍
Here is the change() function, if anyone is wondering how to implement it. I have tried to make it dynamic, but we can make our own adjustments.
Code:
void change()
{
int x = front;
int y = rear;
int z;
if(isEmpty())
{
cout
Thankyou so much....explained it so well.
to understand dequeue operation better use this :
void dequeue(){
if(isEmpty()){
cout
Best explanation but in the count function it is (rear - front +1 ) but if both the rear and count are at -1 and -1 the count should be zero but it is 1..
Well in that case we should add if else statement in count function to show the isempty condition(rear=front=-1).Then your problem will be solved.
Why we cannot have peek operation in queue data structure?
We can. Its just that it is not considered as a standard queue operation. In some cases it is. So its really on you how you implement ✌
If you will take question it will be better 🙂
Wow...now I know what is queue... 😌
Thankyou sir...🙏🙏🙏
That's great to know buddy 😁 please subscribe & share this channel with your friends yaa😊✌️
bro you are the best
Thank you so much buddy
One doubt bhaiya kya hum enqueue nahi karsakthaa values koo after performing dequeue operation kyku ki waha phar zero hai naa
best explanation sir you are the best i realy like it good sir keep it up you deserve the suscess insallah
Many many thanks
@@SimpleSnippets Most welcome sir i really liked your vedios very helpful seriously from islamabad pakistan
in dequeue why we have written return x, i mean we dont need that x right. could the return type of dequeue be void??
Good question, when you simply want to remove it you can keep it void, but if you want to use it somewhere, returning might be helpful 😇
even if the queue is empty, the COUNT shows 1.
Please correct that exception.
.
.
Good work man!
Thank you so much 😇
Edit the code like this:
int count()
{
if(front == -1 && rear == -1)
return (rear-front);
else
return (rear-front+1);
}
Then your problem will be solved.
i decide to shift all element to left after i dequeue.. and i think using front and rear more effective if the element are dynamic like linked list
for the problem at the end when you remove items from the front of list, why can't you shift every item left one space so that your new front item will be at index 0; then the rear would be decremented by 1. Therefore, your rear==4 will return false because now is rear==3
I was thinking the same thing but then how would the code look like? Could we use a for loop?
When we dequeue all the elements how the rear and front go to -1 as there is no change in rear in the else part of the dequeue function. Whenever i dequeue all the elements i can not enter new elements in the queue so the queue becomes useless. Can you help me?
to overcome this limitation, circular queue comes into picture
If you add 3 element in the quee and then dénuée the first element you will have something like 0 56 34 0 0 and if you call the count function it will execute rear-front +1 which is =-1-(-1)+1=1 ;which is wrong because you still have 2 element not one so to fix this you can initialize int itemsnumber. to 0 and do for (int i=0;I
My English is great but I hope you understand what i meant
I have just used rear variable for the implementation I run in for loop I just make arr[rear]=0 and than decrement the rear In dequeue operation....it is correct? Else we must use the two variable to implement the queue operation
Amazing explanation
Thank you Anisha, please do subscribe & share the videos with your friends. Thats the biggest support you can provide to the channel 😇
You are saving my 3rd semester. 🙈 🙈
Thanks a lot. 👍
Please make some videos on graphs also....
I guess I didn't find them in Data Structure's play list....
Will upload soon
When we carry dequeue operation, should the elements shieft by one index towards the element which was dequeued?
Like we have five elements
10 20 30 40 50.
And we carried dequeue
Then 10 gets dequeued
And the new sequence should be
20 30 40 50 0
Right?
You can make that happen according to your needs. Generally its not how a very basic queue operates ✌
@@SimpleSnippets ok.Thanks
What if you want to make a queue of size value entered by the user?
dyanmic memory allocation ✌
why do we use return in enqueue function in if(isFull()) where as enqueue function type is void and does not return any type. please help me understand it.
Best explanation 💯💯
Appreciate that! Please do share the videos and our channel with your friends if you want to genuinely support me & our channel!✌😇
Nice code but if someone insert 0 in the queue and display it then the output will be just zeros and it may become confusing at that index whether element is inserted or is it empty position. While displaying 0 should be converted to null.
You can add that functionality with some extra code ✌
When we create methods it is in the responsibility of the user (programmer) to make good use of those methods. For example, since you implemented the isEmpty() and isFull() methods, it is better to use them (in main method) before calling the enqueue and dequeue and not use them inside methods.
example
in class
/////////////////////////////////////////////////////////////
void enqueue(int val)
{
if(front == -1)
++front;
arr[++rear] = val;
}
/////////////////////////////////////////////////////////////
int dequeue()
{
int val = arr[front];
arr[front] = 0;
if(front == rear)
front = rear = -1;
else
++front;
return val;
}
//////////////////////////////////////////////////////////////
in main()
case 1:
cout > value;
if(!q.isFull())
q.enqueue(value);
else
cout
Very very thankful sir
You are awesome😇
That's great to know buddy, please do Subscribe to our channel as we have a lot tech educational content which you'll surely like. Also please do share our channel and videos with your friends too, that's the biggest help and support you can provide buddy ✌
Thank bro 🙏🙌love 💘
Can you please upload vedios on
What is doubly ended Queue (Dqueue) and it's c++ implementation using linked list representation
C++ implementation of Queue using circular linked list
C++ implementation of Stack using linked list
I have done stack using linked list and queue using linked list I guess. check the full course!
Ok thankyou
Then please make a vedio on Dqueue
We can just use return (rear+1); for count
That will only work correctly if you have not dequeued anything. Once you dequeue an the front idex moves from zero, (rear + 1) will give you a count that is more that what is in the queue
Sir can we use this code in turbo c++ ide ? Please answer
Shouldn’t we advance the entire queue by one position when dequeue() method is invoked? That will make room for one more element in the queue to be added.
when we enter count in empty queue then count value should be 0 but in this code count value is showing 1
You can call isEmpty and return 0 if it is true to fix this
@@christianclark1309 thanks dude
Good explanation
Thank you so much bro. I would request you to please share the video with your friends too 😁😊
Amazing ❤️🇧🇩
bool isFull()
{
if(rear==4 && front==0)
return true;
else
return false;
}
If statement should be like that coz, after fully filling the array and doing dequeue... The front increases but not rear ... & Thus it's not actually full, still it shows FULL .. coz front = 1 and rear = 4 ...
So in if statement, both conditions should be checked !!
There is mistake in count function also...if we does not enqueue any value....count must be 0 but this will show 1 because in that case rear and front both are -1 and -1-1+1 is 1.....so put this case also in count function when front and rear are -1
Yes agreed! This was a silly mistake from my side ✌
Bhaii plz btao ki agr hame dynamically user se size lena h to kaise krenge 🙏🙏🙏😓😭😭
Is there an option to replace 0 with null because if someone enqueue 0 then it will be confusing right. When he uses display function then it will show the empty ones which is 0 and his 0. So how to solve that issue.
Sir you are initializing the array indices with 0..... What if we want to add 0 in the queue it might be confusing that index has some value or is it empty?
when we enqueue 5 items and then dequeue 1 item... it places 0 at that place...and then again if we enqueue 1 item it says queue is full ??? why???
can you pls explain how to enter size of array dynamically instead of already keeping it as 5??
int s ;
int arr[s];
and then you can take value of s ;
cin>>>s ;
@@dt8129 where should we include this code? Under private or public section?
@@dt8129 better way is to use a pointer : int* ptr = new int[take input from user]
Sir ,the only thing I didn't get is when we assign all values of array 0 .them why queue is empty??
Yes Queue is filled with zeros but we have assigned front and rear as -1 therefore Queue is empty.
What if we are having some of our array entries as zeroes.. it will just make confusion ? Any soln over it?
Dequeue operation perform nai ho rha es code .any other code?
I didn't see any particular use of variable front it just use to store 0?
your tutorial is awesome. It will be more effective if you give the source code.
Sir please 🙏🙏 🙏 do the video on queue abstract Data type
in count function what if the queue is empty --> rear-front+1 would give wrong ans
I think you should check your dequeue "else" block
it should be
[x=arr[rear];
arr[rear]=0;
rear--;] in order to established FIFO or LILO
in your code it is currently performing FILO or LIFO(stack)
Am I right or not bro??
You re wrong
thanks so much man
I have a ques why we don't have a change() function in queue?
Request you for your answer
Yes I have same doubt bhai✋
if we initialize arr[i]=Null; in constructor ,is it correct?
bu the display function, the address of the elements is also getting displayed after the elements . I am new to c++ plz help
Do have a place where you share these codes?
Visit his website , u will get it there
So, I had a quick question. When is a queue full? I understood all the concepts and your video was AWESOME (as always haha)... but not being able to define if the queue was full or not made me think what a queue being full meant? I'd appreciate if you could let me know. Thanks and like you always say... Peace
I didnt really get your question here. A queue is full when all the values in it are occupied. A simple queue also has one drawback when a queue is dequeued the front pointer moves one position ahead essentially reducing the size of the queue by 1 because the front of the queue has to be removed off so we do it by dereferencing(meaning the front pointer no longer points to it). This creates an issue where some space from the start gets wasted after every dequeue. Hence we have circular queue as well to tackle this issue. Check the circular queue video I think you will understand much better what I am trying to explain here ✌
@@SimpleSnippets so my question is why we cannot define the is_full() func like this for a linear queue?
isFull()
{
if(f==0 and r == (size(arr)-1))
return true;
else
return false;
}
in the isFull() function?
@@dibbyabarua9499 because we just can't add further entries because the last value is present so as to deal with this exception we checked the rear end as size-1. This can be solved with dequeue
@@MasterPanda10998 I did it instead using a dynamic array or linked list... Which can grow or shrink base on the operation done on it. Peace.
Bro kindly can you please make a vedio on queue by dynamic data structures
Sure thing but will take time :-)
@@SimpleSnippets ok bro
Sir can you please upload quiz for your covered topics. Thank you
As soon as possible
thank you! :)
i went to the site for this topic and in there is an error in the dequeue implementation
What happens if I define all the functions inside the main() and not under the class?
Try it and you will know
nope in display i should be less then rear else it will display zeros
void display() {
if (isempty()) {
cout
Amazing
Thank you! Cheers!
sir you told about 1 drawback of a simple queue is that isFull() couldn't give the correct and when some elements were dequeued but I coded it like this which gives true only when a queue is full otherwise not
bool is_Full(){
if(last-head==4)
return true;
else
return false;
}
please inform if it is wrong
but you are teaching in an awesome way I love it and now I'm addicted to learning from only you
int count(){
if(rear == -1 && front == -1){
return 0;
}
else{
return (rear-front+1);
}
}
I wrote this as count function and it is not working! can someone help?
Why does my code says i use undeclared variable x? But your code runs smoothly
int Dequeue() {
if(!isEmpty()) {
int x = arr[front];
for(int i=0;i
You made a mistake for dequeue method at else if (front == rear). arr[front] should set to 0 after dequeuing. See * below.
int dequeue(){
int x;
if (isEmpty()){
cout
Bhai why dont you create change and delete method in the class.
Is it means that these methods we cant use in the Queue data structure?🤔
Count method has a bug.
The first statement must be:
if(isempty()) return 0;