thank u sir,only because of you some students will learn the concepts of data structure very deeply and clearly...and let me tell you sir, i got a reappear in C++ so when i was preparing for my reappear exam i saw your videos and it was like a boon for me because i got 42 marks out of 50... so you are a very gud teacher and dont think about these jerks who tells you that you misguide us, so just ignore them.
+himanshu sain Thank You Himanshu, I am working for the students like you, who understands the importance of good teaching....What you wrote is motivation for me. Thank You for watching, and keep sharing and spreading, there are many students who are in great need of these videos.
oh thank u sooooo Much Sir its your master piece i am from lahore pakistan lots of love and regard for your this work ii dont often understand programing but after your lec i am thinking it is easy and possible thanku love :-)
Thank you Sir! Having my exams day after tomorrow...I wasn't getting this avl tree after reading the book but now I have understood what exactly it is...superb work! Keep it up sir..,looking forward to watch more videos by u.
hello sir... i just watched ur avl tree's video n that was really helpful... but i didn't find ur red black tree's video... i need this one bcoz i have to clear the concept of red black tree...
Sir i could understand avl tree from your lecture.your approach of teaching is very good and sir i request u to make a lecture of splay tree.-aman mishra
Thank u sir u r the best teacher. Ap bhot ache se samjate hai.plz tell me about in which book ,there is questions on data structures so that we can solve.
thank you sir...u hav been vrry helpful to me fr knowing the data structure,c,c++ and java ...juz bcoz of u nw i knw the programming language .plz keep doing all this thngs..dnt juz stop it.u couldn't hav any idea how u helping people. probably,we the student,dont b abl to learn these topics frm books.everybody gest in trouble. bt when i go through ur tutorials its became vrry easy fr me..i cant thank u enough fr dat. wl u plz give us a brief idea abot graph theory,Hashing,sorting and searching??? um eagerly waiting fr ur upcoming lectures.
You save people lives everyday :)
Yo man 😆🙃
@@akankshaporwal5566 😁
@@rohanahmed4921 7year old cmnt ka rply 😏
Ka chakr Babu bhaiya
Bhai aapke toh bachhe bhi gravitational law padhne lage honge🤭
thank u sir,only because of you some students will learn the concepts of data structure very deeply and clearly...and let me tell you sir, i got a reappear in C++ so when i was preparing for my reappear exam i saw your videos and it was like a boon for me because i got 42 marks out of 50... so you are a very gud teacher and dont think about these jerks who tells you that you misguide us, so just ignore them.
+himanshu sain Thank You Himanshu, I am working for the students like you, who understands the importance of good teaching....What you wrote is motivation for me. Thank You for watching, and keep sharing and spreading, there are many students who are in great need of these videos.
Teaching method is wonderful .. appreciable
thanx for spreading ur knowledge.. keep it up sir
+Jamal Ahmad visit www.mysirg.com
oh thank u sooooo Much Sir its your master piece i am from lahore pakistan lots of love and regard for your this work
ii dont often understand programing but after your lec i am thinking it is easy and possible thanku love :-)
Thank you Sir! Having my exams day after tomorrow...I wasn't getting this avl tree after reading the book but now I have understood what exactly it is...superb work! Keep it up sir..,looking forward to watch more videos by u.
+Juhi Mokal Keep watching, visit www.mysirg.com for more videos for FREE. Please share and spread these videos on FB.
hello sir... i just watched ur avl tree's video n that was really helpful... but i didn't find ur red black tree's video... i need this one bcoz i have to clear the concept of red black tree...
the way of convince the concept is just awsm...i watch most of your videos.... thanks a lot
+Aditya Prakash visit www.mysirg.com
Thank you sir, love from Pakistan 🇵🇰
samajh me aa gya sir...........thanku sir
Nice Really Liked It Good teaching method
Keep it up Sir
+Waqar Siddique visit www.mysirg.com
You really make us to understand the concept.Keep it up.
if i want to make avl trees with same keys .how many trees can i make?only one?
Very smooth explanation 👌👍👌👍
After seen this video, I have understood of AVL tree
Thanks so much saurabh sir
Sir i could understand avl tree from your lecture.your approach of teaching is very good and sir i request u to make a lecture of splay tree.-aman mishra
gud 1 sir ji........... hume to english ne mara. kaash har topic aise hi hindi me available hota
Sir implementation of AVL tree is considered rigid... Why??
And sir please do upload video on RED BLACK TREE which is used in ordered maps .
i love you so much sir ...
i can't leave your chanel i have a course on coding ninja for dsa still i watch your vidios i love you so much!!!!! :-)
i learned c,c++,web dev etc from your chanel for free
nice sir ji ....i love it ...wish aap jese teachers hamare collage me hote...
Absolutely sir all the thng whcevr u described is really easily understood
SIR, U ARE ALWAYS ROCK, THANK YOU
+Chirag Shinde Thanks for ur supporting words dear
Department kon sa h
such a beautiful lecture i ever attain before sir keep it up..u really save study time..
very very clear sirji!!!!! very much explanatory
best video ! Thanks and keep it up :)
u r awsm sir....bhaut help hoti hai mujhe
Thank u sir u r the best teacher. Ap bhot ache se samjate hai.plz tell me about in which book ,there is questions on data structures so that we can solve.
Sir, your teaching is excellent. My sincere thanks to you.
NICE VIDEO
👌
Nice explanation, Sir please upload the video lecture of red black tree also
SIR u r one of the best teachers in met
Very nice
Ok
kamaal kar dia FROM PAKISTAN
Sir you teach very very good .please teach all the subjects of gate cse .
awesome.....really muje zarurat ha ur videos are 👍
Bahut hard sir smjh dete hai.
Sir insert a node in linked list and insert a element in linked list is, equal or not ??
Great ✌
Thank you so much sir
I like you the most
Sir plz make a Lecture on Deletion in an AVL search tree.
osm 😎😎😎😎
Thank you sir this is video most helpful
good..
How a node is inserted in an avl tree
grt job
Very good explanation
awesome teaching..thanks a lot
Sir aapne mera future bright kr Dia thank you 🙁🙁🙁
height of tree and level of tree mai kya difference haii
Thank u sir... Its realy very helpful..
thank you sir...u hav been vrry helpful to me fr knowing the data structure,c,c++ and java ...juz bcoz of u nw i knw the programming language .plz keep doing all this thngs..dnt juz stop it.u couldn't hav any idea how u helping people. probably,we the student,dont b abl to learn these topics frm books.everybody gest in trouble. bt when i go through ur tutorials its became vrry easy fr me..i cant thank u enough fr dat. wl u plz give us a brief idea abot graph theory,Hashing,sorting and searching??? um eagerly waiting fr ur upcoming lectures.
+mainak singha keep watching videos and visiting www.mysirg.com, I am daily uploading few videos
SIR you r the best
Thank you very much sir, you are doing a grat job...
Very helpful! easy to understand
its gr8 sir thnqq
Sir,
how can we find number of elements in a given binary tree.
Thank you our sirG
Best
Superb
🙏🙏🙏🙏🙏
Ap achha padhate hai
Good mentor 👍... Go ahead
Grt sir...from Pakistan
sir ye deletion in avl tree nhi hai kya
very very helpful sir
Superb explanation sir
thank you, sir for awesome vedio
Sir AP na binary tree ki insertion,deletion,search ki vedio banai ha Kya not binary search tree
thanks sir its very help full for me
very helpful sir
Very very nice lecture sir
Sir aap mahan ho
good job sir
ThanQ
why&how bst has time complexity = o(log n)???
nice
Thank you sir
Ap ki video ki awaz bht kam hoti ha sir....😟 Baki ap samjhaty bht acha ha 😃
9:28 it will be non empty binary search tree not binary tree.
great sir
great sir.....
Sir how time complexity is 0(log2n)
log2n is the number of time n can be splitted in 2 parts (like every level in a binary tree) so height is log2n so O(h)=O(log2n)
Sir plz kuch ssa gadget use krriye jo.. clear likhe.... screen pe... bhit dikkat hoti.. systematic likha ni hota tho..
Sir plz upload videos related to graph, balanced tree,heap tree,heap sort
Sir vedio aachi hai kafi but sir eek real implementation ki bhi vedio honi cchiye avl tree pr
Good sir
thanks sir very much
Thank you sir...
superd explanation sir
Thanxx a lot sir
may thanks sir :) superb
sir please take the class very fast..........your lectures take too much time.......
I will try to sum up in the short
Yes, I agree with Sayan. But Sayan you can mitigate that by increasing the streaming speed from youtube setting. Usually, I use 1.5x
no , this speed is good , i watch on 1.5 x.
and he is so clear.
I watched in 2x speed
sir pls give a lecture on deletion in AVL tree
excellent
Thanx Sir
hello sir ji....btech m dsuc subject ko kaise prepare kre ?.....mdu syllabus
help me sir
sir your lacter mistake in unbalance avl tree...here balance factor of left sub tree value 40 is 1..plz check
100thanks
thank u sir.
Sir can you make a video on red black tree??