I like his lectures a lot but that is the main problem in youtube many courses start but very very few get completed. Many of his series are remaining like java and all,his teaching is really good. I would be ready to pay but want complete courses.
Our future depends on your DSA videos! That's the honest opinion! Please, continue with this course. Take your time but don't stop making these videos! You are doing a great job. Proud of you!
PS CONTINUE THE SERIES.........BRO........KOI BAAT NI ABHI THODE KAM VIEWS H AAPKI PLAYLIST PE..PR BELIEVE ME FUTURE M ISI PLAYLIST PE BHUT M VIEWS HONGE SO DON'T BE DISHEARENED AND PLEASE CONTINUE THE SERIES...SOON
Harry sir ! it's our humble request please complete the course .There is a lot of topic such that "Graphs","Map",Hashing"etc. Hope you will understand our problem and thank you for teaching you are doing great job :)
Please continue this course, I'm right now in college.. doing classes online mode and teachers are just...... U make every topic of ds algo so easily understandable..... Please add more videos 🙏🏼
For all the students, to learn data structure and algorithms has become a big challenge and they don't find way to start. But this playlist is awesome and it makes me easy to learn data structure .... And I am waiting for upcoming videos in this playlist.
harry bhai course bhot badiya h please isse continue krr do aur hashing greedy jaise advanced concepts bhi samjha do aise beech me humara saath na chhodo
😥😥😥😥😥😥😥 Our future depends on your DSA videos! That's the honest opinion! Please, continue with this course. Take your time but don't stop making these videos! You are doing a great job. Proud of you!
I am going to start this playlist after some days so please continue with the series. Maine python bhi aapse sikha hai aur dsa bhi aapse se hi sikhna chahta hu.
Bhaiya, please continue karo is course ko, bahot easy se bataya hain apne, is tarah se koi nhi padhyayega. Please upload the videos soon. Love from Bengal
I HAVE ACCESSED EVERY SINGLE ONE OF THE VIDEOS IN THIS PLAYLIST AND TPED MOST OF THE CODE SIDE-BY-SIDE WATCHING THEM MYSELF...BUT NOW I CAN'T DO THAT BECAUSE THIS WAS THE LAST VIDEO IN THIS COURSE...! I UNDERSTAND YOU HAVE OTHER THINGS TO DO WITH YOUR TIME TOO BUT WE'RE STUCK FROM THIS POINT! PLEASE CONTINUE WITH THIS COURSE AT LEAST BECAUSE IT'S PACTICALLY THE MOST IMPORTANT ONE! AT LEAST INFORM US WHEN YOU'LL BE ABLE TO GET BACK TO THIS COURSE PLEASE! A HUMBLE ADJURATION!
watched all your videos from 1 to 76 ! they were great ! your play list helped us a lot !! but if there are any topics left ! please do complete the course.
Harry Bhai, GATE CS ke liye bhi videos banado, saare core subjects ke banado, way of explanation bohot sahi h aapka, THANKS A LOT for all the free videos.......
are bro i understand ki likes bahut kam aa rhe hai but is video mein to 1k likes mile bro that means people still love this course. Why stop its a humble request plz continue.
Dynamic Programming, Greedy, Divide And Conquer, Recursion and Backtracking, Segmentary, DisJoint Sets jaise baki advance concept ko bhi coding kra doo bhai...bohot dekht atti h in sb m
Concept is more important so don't worry about late posting of source code and notes we can wait for it .😄thanks Harry sir for making great videos on ds and algo.
Sir please complete the lectures of this series ! I am from a needy family , I can't afford the institute coaching fees for ds and algorithm! Your teaching style make me to understand the topic easily ! Please sir don't break our hopes , we need you ❤️
Hey all my codewithHarry mates and friends....... Let's help Harry bhai to continue this series *Step to convince Harry bhai... Step 1 - whenever you have to revise a topic use different different email id.... Step 2 - like 👍 videos Step 3 - Share video on social media.... Step 4 - suggest your friends...... Step 5 - Suggest Harry bhai to continue on every new videos comment section...... 🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏 Please Harry bhai we love you effort....... Please continue ds&a and java series....... please 😭😭😭😭😭
*After the while loop get's over the root variable is pointing to the same position where prev->(right/left) would be pointing So after creating node "new" why can't we just do root=new; Instead of checking again wheather the key is greater than prev->right or not Thanks for your playlist you makes thing easy !!! *
I think this is the first operation , there's iterative approach is more easy than recursive... Thank your Harry bhai you are the best teacher.... #include #include #include using namespace std; struct node { int data; node *left; node *right; node(int val) { data = val; left = nullptr; right = nullptr; } }; void insert_data(node **main_root, int val) { node *root = *main_root; node *t = new node(val); if (root == nullptr) { root->data = val; } else if (root != nullptr) { while (root != nullptr) { if (root->data == val) { cout val) { root->left = t; return; } else if (root->right == nullptr && root->data < val) { root->right = t; return; } } } else { cout left = new node(3); root->left->right = new node(6); root->left->left = new node(1); root->left->right->right = new node(7); root->left->right->left = new node(4); root->right = new node(10); root->right->right = new node(14); root->right->right->left = new node(13); insert_data(&root , 8); inorderTraversla(root); }
Why did you stop here plzzz continue sir plzzzzz......🥺🥺 . . . . Plzzz sir we want to learn, I seen your al videos perfectly and understood all of them. Sir please continue this is matter of our future 🥺
Thank you for the course, but some topics (like hashing, graphs, etc) are still pending. Will those topics be covered here? Once again thank you for this awesome course.
Pls continue with the course, Harry bhai 🙏
where is the notes bro??
Harry bhai please continue this playlist
Bhai agar kisi ne pure notes download kar liye ho to Bhai humein bhi dedo hamare zip file open nahi ho rahi
pls pls
I like his lectures a lot but that is the main problem in youtube many courses start but very very few get completed.
Many of his series are remaining like java and all,his teaching is really good.
I would be ready to pay but want complete courses.
Our future depends on your DSA videos! That's the honest opinion! Please, continue with this course. Take your time but don't stop making these videos! You are doing a great job. Proud of you!
PS CONTINUE THE SERIES.........BRO........KOI BAAT NI ABHI THODE KAM VIEWS H AAPKI PLAYLIST PE..PR BELIEVE ME FUTURE M ISI PLAYLIST PE BHUT M VIEWS HONGE SO DON'T BE DISHEARENED AND PLEASE CONTINUE THE SERIES...SOON
You are correct bro plz sir continue this series we r eagerly waiting for next DSA video...
thanks for these efforts Harry Bhai and PLAEASE PLEASE CONTINUE this series
Abhi kitna lecture baaki rah gya hai DSA complete hone me.(approx)
I am going start right now. Please continue sir.
Harry sir ! it's our humble request please complete the course .There is a lot of topic such that "Graphs","Map",Hashing"etc.
Hope you will understand our problem and thank you for teaching you are doing great job :)
These are the important concept n hard to understand please proceed this playlist.
haa bro yeh bht important topics hai harry sir kab danlenge ese topic pata nhi
@@webcreationstudio7088i think soon
Harry Bhai it's our humble request to you for uploading more content for this DSA series. We are very grateful for having teacher like You.
Harry bro Dynamic Programming, Greedy, Divide And Conquer, Recursion and Backtracking, Segmentary, DisJoint Sets jaise baki advance concept ko bhi coding mein samjao!!!
Please continue this course, I'm right now in college.. doing classes online mode and teachers are just...... U make every topic of ds algo so easily understandable..... Please add more videos 🙏🏼
You are great brother....
Love your teaching style
Pls continue the course..🙏🙏
For all the students, to learn data structure and algorithms has become a big challenge and they don't find way to start. But this playlist is awesome and it makes me easy to learn data structure .... And I am waiting for upcoming videos in this playlist.
harry bhai course bhot badiya h
please isse continue krr do aur hashing greedy jaise advanced concepts bhi samjha do
aise beech me humara saath na chhodo
😥😥😥😥😥😥😥
Our future depends on your DSA videos! That's the honest opinion! Please, continue with this course. Take your time but don't stop making these videos! You are doing a great job. Proud of you!
I am going to start this playlist after some days so please continue with the series. Maine python bhi aapse sikha hai aur dsa bhi aapse se hi sikhna chahta hu.
Bhaiya, please continue karo is course ko, bahot easy se bataya hain apne, is tarah se koi nhi padhyayega. Please upload the videos soon.
Love from Bengal
I HAVE ACCESSED EVERY SINGLE ONE OF THE VIDEOS IN THIS PLAYLIST AND TPED MOST OF THE CODE SIDE-BY-SIDE WATCHING THEM MYSELF...BUT NOW I CAN'T DO THAT BECAUSE THIS WAS THE LAST VIDEO IN THIS COURSE...!
I UNDERSTAND YOU HAVE OTHER THINGS TO DO WITH YOUR TIME TOO BUT WE'RE STUCK FROM THIS POINT! PLEASE CONTINUE WITH THIS COURSE AT LEAST BECAUSE IT'S PACTICALLY THE MOST IMPORTANT ONE! AT LEAST INFORM US WHEN YOU'LL BE ABLE TO GET BACK TO THIS COURSE PLEASE!
A HUMBLE ADJURATION!
Tum SRM me padhte ho...J1 section me
@@benstokes4120 🤫
Continue the course...
Harry bhai next time abhi tk aaya hi nhi😞😞
Please please continue the course.
Ek aap hi toh sahara ho🙏🏻🙏🏻
pls bhai
sir please continue this playlist 😭😭😭😭😭🥺🥺🥺🥺🥺🙏🙏🙏🙏
watched all your videos from 1 to 76 ! they were great ! your play list helped us a lot !! but if there are any topics left ! please do complete the course.
Please continue this ds algo series.
Brilliant logic. Thanks for this series.Hatsoff MAN!!
Harry Bhai, GATE CS ke liye bhi videos banado, saare core subjects ke banado, way of explanation bohot sahi h aapka, THANKS A LOT for all the free videos.......
are bro i understand ki likes bahut kam aa rhe hai but is video mein to 1k likes mile bro that means people still love this course. Why stop its a humble request plz continue.
did all operation of all data structure without looking using your one line code but you are amazing
Please upload the concept of AVL binary tree
where is the notes bro??
Arre bhai see you next time bolke kahan nikal liye... please continue this dsalgo series.
Bhai bahut mast kaam krte ho tum.. Naukari lagegi tab applauds zaroor bhejunga...
Brother please complete this course. It was going well and smooth.
I Increased "5 Likes" With My 5 Google Accounts 🙂
Very nice!!
👍☺️
now that's dedication.
Please sir
Lmao
Harry Bhai please continue Karo na ye course 🙏🏻🙏🏻🙏🏻🙏🏻
Just now completed this playlist....Harry bhai please continue this series.
Harry Bhai ! please continue course. we need videos on graph too.
Please continue this playlist Harry sir...🥺
bhaiya you give the best content on youtube!!!!!!!
you never reply to my comments... ek baar kardo please !!!!
Harry sir please continue this course. Loved your content so far
Thank You So Much Harry Bhai🙏🙏🙏🙏
plz complate this series
exams are in 2 weeks
or suggest somthing for learn hashing to pass
where is the notes bro??
first link in discription
Nothing is there bro
sir aur bhi videos chahiye aisi. Hashing, heap, graphs, etc... yeh bhi bache hai sir. Plz inhe bhi cover kar dijiye!
Aur sir algorithms bhi bacha hai...
Really appreciate ur work sir! :D
Bro when you started coding
Plz make video on your struggle
@Manan Kuraware yes he is genius
PLEASE CONTINUE THIS SERIES . I LEARN ALOT A BIG THANKS TO HARRY BHAIYA! LOVE FROM NITW
Best content harri da
Bhaiya please 🙏 age course continue kijiye bohut help milti h 🙏🙏
Dynamic Programming, Greedy, Divide And Conquer, Recursion and Backtracking, Segmentary, DisJoint Sets jaise baki advance concept ko bhi coding kra doo bhai...bohot dekht atti h in sb m
Bhaiya , please continue this course.🙏🙏
Really this course is amazing and Harry bhai is a great teacher
thanks harry bhai apne bacha liya paper me
love you 🥰
Finished today. Ultimate playlist. Keep it up bro !! God bless !!
We want the DSA vedio fast 🙏🙏🙏♥️🔥🔥
Concept is more important so don't worry about late posting of source code and notes we can wait for it .😄thanks Harry sir for making great videos on ds and algo.
Thanku soo much sir for.making videos . Please complete the playlist as far as possible .
Hey
data structures play list wached complete
please continue this course
Please aage videos banaiye sir.🙏🏻👍🏻
Please continue the course , it is a brilliant course I am waiting to be completed. You are doing a very great job .
Sir please complete the lectures of this series ! I am from a needy family , I can't afford the institute coaching fees for ds and algorithm! Your teaching style make me to understand the topic easily ! Please sir don't break our hopes , we need you ❤️
Please continue this course and covered all topics
Literally No one 😂😂 When Harry Bhai uses, pure Hindi words.😁
harry bhai sem exam aane wala hai,, course ko jaldi complete karo na pls pls pls
where is the notes and source code bro??
@@rajdeepraj2842 check description...
sir please complete the course.....it's very helpful for all of us.
Hey all my codewithHarry mates and friends.......
Let's help Harry bhai to continue this series
*Step to convince Harry bhai...
Step 1 - whenever you have to revise a topic use different different email id....
Step 2 - like 👍 videos
Step 3 - Share video on social media....
Step 4 - suggest your friends......
Step 5 - Suggest Harry bhai to continue on every new videos comment section......
🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
Please Harry bhai we love you effort....... Please continue ds&a and java series....... please 😭😭😭😭😭
*After the while loop get's over the root variable is pointing to the same position where prev->(right/left) would be pointing
So after creating node "new" why can't we just do
root=new;
Instead of checking again wheather the key is greater than prev->right or not
Thanks for your playlist you makes thing easy !!! *
I think bcoz empty nodes are NULL that's why we can't do it as it doesn't have any legal address....
Thank you so much sir for this course 🙌🙌
Please bro complete the course... your videos always help me a lot...
Continue the series sir 🙏🙏🙏
where is the notes and source code bro??
@@rajdeepraj2842 arey bhaiya kitna copy paste krega
Harry vaii.... Please Continue this course.
continue this plz ,this is important for placements than any other
Waiting harry bhai !!!!!!!!!
Sir plz continue this course it really help me alot🙏🙏
Sir Please continue this series 🙏🙏
where is the notes and source code bro??
@@rajdeepraj2842 In the description of the video
Nothing in that link bro
Sir banate rho yeh series FULL SUPPORT SIR..
Please countinue this playlist 🙂❤
Pls continue the course🙏🙏🙏🙏🙏🙏
Harry bhai plzzz continue ....
Harry Bhaiya!!!!!!
please pls pls pls .....
course ko continue karo na ,
We all need your guidance in DSA , pls continue this course
I think this is the first operation , there's iterative approach is more easy than recursive...
Thank your Harry bhai you are the best teacher....
#include
#include
#include
using namespace std;
struct node
{
int data;
node *left;
node *right;
node(int val)
{
data = val;
left = nullptr;
right = nullptr;
}
};
void insert_data(node **main_root, int val)
{
node *root = *main_root;
node *t = new node(val);
if (root == nullptr)
{
root->data = val;
}
else if (root != nullptr)
{
while (root != nullptr)
{
if (root->data == val)
{
cout val)
{
root->left = t;
return;
}
else if (root->right == nullptr && root->data < val)
{
root->right = t;
return;
}
}
}
else
{
cout left = new node(3);
root->left->right = new node(6);
root->left->left = new node(1);
root->left->right->right = new node(7);
root->left->right->left = new node(4);
root->right = new node(10);
root->right->right = new node(14);
root->right->right->left = new node(13);
insert_data(&root , 8);
inorderTraversla(root);
}
Why did you stop here plzzz continue sir plzzzzz......🥺🥺
.
.
.
.
Plzzz sir we want to learn, I seen your al videos perfectly and understood all of them.
Sir please continue this is matter of our future 🥺
Please Complete the course harry sir as soon as possible
Please continue this course 🙏🙏🙏
Harry sir please complete the course.There is lot of topic like hashing,graph,heap in BST which is not covered in this tutorial.
I never understood this in class thanks for explaining this.
sir plz continue the course plz plz don't stop uploading videos
please continue with this course harry bhaiya !
sir please continue the series for completing the course pls sir plssssss
Please continue this course Harry vai plss....
Harry Bhai,
Waiting for Heap Sort, hashing, graph, dynamic etc. please complete the series
Sabhi harry bhaii to insta story pr mention kro
Or likho, (pls continue the playlist)🙏
Harry bhai continue kro plzz🙏🙏🙏🙏🙏🙏
Please continue this playlist ❤️❤️
Harry bhai series continue krdo plss...
Bhai kon si university hai teri?
Please continue the series!
Thank you for the course, but some topics (like hashing, graphs, etc) are still pending. Will those topics be covered here?
Once again thank you for this awesome course.
@MONOKITE FANTASY second year (4th sem)
@MONOKITE FANTASY it's a complete subject taught in computer science in 2nd yr
@MONOKITE FANTASY yes, it'll be taught in the college too, but not as good as Harry sir😌🙏 (atleast not in our college)
where is the notes and source code bro??
Thank You Very Much.
ls continue with the course, Harry bhai 🙏
utpanna word is funny 😁, nice teaching style
Harry Bhai please continue this course 🙏
Please continue this course harry sir...
where is the notes and source code bro??
@@rajdeepraj2842 check description
Please complete the course harry sir
It is very useful
Please continue harry sir♥️
great effort sir.....keep doing for us....
He is the best!!
return with no expression like return; as used in the program in video 11:49 means?
This means we just want to get out of that function, without returning anynode or any data