People at my University always complain about people with accents in videos, but they're actually some of the best videos and provide the best explanations! I understand these videos 10x more than other videos I've seen
Merhaba from Turkey, I am grateful for your helping hand Jenny, it is very nice of you. Despite that I am not a student prepping for exams, I found your videos very helpful in my professional life of software. In addition to the lecture, array always starts with "0" so that Parent Index: Floor ( (ChildIndex - 1)/2 ) and as for Children; Left Child Index :2xParentIndex + 1 and Right Child Index :2xParentIndex + 2
I got reappear in data structure in 3rd sem...now im in final year...finally i have cleared my daa exam in last attempt with good grade.....just because of ur lectures ✨.....thanku ma"am😇
Was getting discombobulated in the beginning but, now, I'm simply swelling with the sheer amount of confidence. This wouldn't have been possible, had I not seen the vidoe of yours. More power to you, Jayanti! :)
I started studying before 1day and due to your hard work I will score good in my exams. The question paper was goosebump giving but u r the best tnxx from bottom of my heart 💜❤
Hi. Mam..your videos are very helpful for beginners like me.thank you so much. I have couple of questions 1. How can we differentiate whether the index starts from 0 or 1. 2. How can we identify the position of the item which needs to be deleted
04:19 Max heap ensures that every parent node is greater than or equal to its child node. 08:38 In a max heap, the root node is always the largest element. 12:57 Inserting and maintaining a max heap 17:16 Inserting data in a max heap involves maintaining the complete binary tree property and the maxi property. 21:35 Inserting a node into a max heap involves comparing the value with its parent. 25:54 To delete from a max heap, remove the root node and adjust the tree. 30:13 Explanation of max heap insertion and deletion process 34:28 Explanation of Max Heap Deletion
if u have uploaded this video 2 yr back i must have secured O grades additional concept clearance.Thank u so much mam!! please upload some video related to placements etc.
Mam apka way of teaching bahut jyada saaf h and I have watched many other videos but no one explain like u mam u are the gem of algorithm and one small req can u start array and string coding qustion so that it would help us also plz mam
the implementation of the above explanation in cpp (creating a maxheap and deleting all elements one by one #include using namespace std; int maxheap(int arr[], int n, int a) { n++; arr[n] = a; int i = n; int parent; while (i > 1) { parent = i/2; if(arr[parent] < arr[i]) { swap(arr[parent],arr[i]); i = parent; } else { return 0; } } return 0; } int dele(int arr[],int n) { cout
People at my University always complain about people with accents in videos, but they're actually some of the best videos and provide the best explanations! I understand these videos 10x more than other videos I've seen
I litteraly came back to this exact video because of her lovely accent and clear explaination.
Yeah, a good teacher is good with or without an accent. Only the explanation matters. In this case, it was a great explanation!
Merhaba from Turkey, I am grateful for your helping hand Jenny, it is very nice of you.
Despite that I am not a student prepping for exams, I found your videos very helpful in my professional life of software.
In addition to the lecture, array always starts with "0" so that Parent Index: Floor ( (ChildIndex - 1)/2 )
and as for Children;
Left Child Index :2xParentIndex + 1 and Right Child Index :2xParentIndex + 2
she has discussed in the previous vedios and thnks for the 0th index formulae
Selamlar
Bro aapko hindi aati hai?
@@741ibrahim2 in which lecture? i am confused about this index 0 and 1
American students also benefiting from your lectures, thank you!
American students are also human being they are not from other world so they can also have difficulties in some stuffs .
I am from Pakistan. My data structure teacher is a PHD holder. and still I didn't understand heaps until I watched this video. Thank u.
I got reappear in data structure in 3rd sem...now im in final year...finally i have cleared my daa exam in last attempt with good grade.....just because of ur lectures ✨.....thanku ma"am😇
Wish u luck 👍
Bhai guru dakshina to de..🤣
@@JennyslecturesCSIT It would be great if u provide a working code in description .plz
@Jenny's Lectures
So bruh, did you clear it?
studying 3 hours before an exam and here I am thanks jenny 😍
Mam.....u are the queen of teaching of data structures..... 😘😘😘😘
The way you connected us from heap tree to heap sort was excellent, I think no one will leave without watching the heap sort :)
Whenever I encounter problems of a structure I tend to your lecture and could finally figure out. Thank you with my whole heart. I love you Jenny!
I've gone thorough the many tutorials for heap, but my search came to end here. I can write heap function by myself. Kudos thanks a ton.
Fantastic explanation thank you so much! American software engineers here, studying for interviews again, this is awesome!
Crystal clear concepts and excellent presentation which can put even the professors from best universities to shame. My favorite channel already!
The transition from heap tree to heap sort was smooth as butter
Was getting discombobulated in the beginning but, now, I'm simply swelling with the sheer amount of confidence.
This wouldn't have been possible, had I not seen the vidoe of yours.
More power to you, Jayanti!
:)
You're amazing!! Please keep doing more of lectures..it helps us so much during revision as well studying and referring for exams..
I started studying before 1day and due to your hard work I will score good in my exams. The question paper was goosebump giving but u r the best tnxx from bottom of my heart 💜❤
Your teaching method is soooo good .
I can't tell you my words .
Your method is like a mogic...
Thanks alot
Wonderful teaching method ..from pakistan
Most graceful teacher.
Just when i needed help on this topic. You are a life saver madam
You Have all I Need from teacher.
Now you're my teacher thanks for show me better way.
Mam your teaching is awesome.
I like the way you explain things in great detail. You are a great teacher!
Thank you soooooo much - From "Sri lanka"
Aniwa
This is the clearest video I have seen. Thank you!
A big Thank You from Brazil. You're very talented teacher, made my project easier to understand. I'll recommend you to other people
You teaching is absolutely Fantastic mam.
Awesome teaching i never this type teaching... you're teaching like heaven mam
Mam.. Your passion for teaching is really outstanding...thanks for such tutorials..
Mam you are boosting us to become legends in society
😎😎😎
U r d best teacher in data structure ...no doubt can arise ...i wish u could also give lectures on optimization ...complx questions..
Thank you for your effort! You really helped me a lot and made everything as clear as possible. Again, thank you so much
You are the best teacher!I swear🥺
And thank you for being my life saviour 💜💜
your lectures is very helpful for me. I am from Pakistan. you will get more views as soon.
Your explanation is clear and understandable.
you are great in dsa
Mam your teaching is very very great and thanks mam for your videos
Jennny love your teaching methods
You have cleared my all concepts regarding to data structure thank you 😊😊👍
Mam there are no words to say about you....you are outstanding teacher ever🤗🤗
Such an incredible teacher.. You are a gem of a person..Thank you Ma'am..
mam, seriously you are doing very well and your lectures are according to book curriculum thank you so much ,mam
SHE DESERVES A NOBEL PRIZE IN TEACHING.
You helped me lot man thank you so much for a great sessions 🎉
the way u teach is amazing.mujy teachers ke smj ni ati.ma bus ap k lectures hi consult krti hon.thanks.
Best Explanation Ever!
i will just says LOVE YOU MAM From pakistan and from 1st semester i followed your lectuure your voice is amazing
Hi. Mam..your videos are very helpful for beginners like me.thank you so much. I have couple of questions
1. How can we differentiate whether the index starts from 0 or 1.
2. How can we identify the position of the item which needs to be deleted
i'm Watching her face and her expression more then what she's teaching but teaching is also awesome ma'am as same as your beauty
I really want to become a teacher like you :)😘☺️
I let ,you are wonderful Lecturer.Page replacement lectures is very easy among another......
amazing mam...how clear explanation...😍😍😍
If my teacher would beautiful, intelligent and awesome like you, I could be topper in the class! :D
Excellent tutorial!
This is the best representation of heap! Thank you!
Mam ur explanation is awesome very clear and simple very much impressed
Such a useful data structure...
I got introduced to this from a problem on HackerRank
Thanks for making the concept of heap so simple
Mam aese hi bahin rehin eios r Allah apko humisha Khush rakhi r lmbiumr de
Mam your lectures are awesome and i am requesting you to complete all the lectures of data structures mam at your earliest...
Respect from Nepal...
Addicted to this teacher.
Thankyou for providing wonderful concepts in data structures
Keep on uploading videos mam 💕
04:19 Max heap ensures that every parent node is greater than or equal to its child node.
08:38 In a max heap, the root node is always the largest element.
12:57 Inserting and maintaining a max heap
17:16 Inserting data in a max heap involves maintaining the complete binary tree property and the maxi property.
21:35 Inserting a node into a max heap involves comparing the value with its parent.
25:54 To delete from a max heap, remove the root node and adjust the tree.
30:13 Explanation of max heap insertion and deletion process
34:28 Explanation of Max Heap Deletion
Mam ur lectures r always mind blowing
hatt
Thank you soooooo much - From "Algeria"
Crystal clear explanation mam ❤️🔥✨
Love you 💓 ma'am ,your way of teaching is amazing
Fabulous explanation Ma'am. God bless you
Very clear cut explaination of every particular topic in every video of yours❤️❤️❤️🔥🔥
Excellent explanation. Bunch of thanks😍😍
you are a briliant teacher mam we appriciate to your effrots
Maam thanks for the video.. It was or rather all ths videos are amazing..
I hope u were my teacher for DS......and yes u look cute.. 😊😊
Thank you a lot really your explanation is very clear and perfect 👌
perfect explaination of heap sort
Fabulous teaching✌
Great knowledge and explained in a simple manner 👍👍👍
Thank You! Excellent presentation -- the concept is crystal clear :)
Mam..I like your teaching from June 2019....mam you are gorgeous 😍😍😍😍😍😍😍😍😍😍😍😍😍...and I like you❤️❤️❤️❤️❤️❤️❤️❤️❤️❤️
I love you mam
Bht help mili apki videos se
Forget about data structure... U look amazing👌
Thank you maam.. You saved my time.... Keep up the good work......
if u have uploaded this video 2 yr back i must have secured O grades additional concept clearance.Thank u so much mam!!
please upload some video related to placements etc.
congrats Siddhi!
thank you so much mam your lecture helps me thanx from PAKISTAN
Mam apka way of teaching bahut jyada saaf h and I have watched many other videos but no one explain like u mam u are the gem of algorithm and one small req can u start array and string coding qustion so that it would help us also plz mam
This was very well explained, kudos to you!
It's simply super explanation
Beautifully explained.. 👍👍
Very nice for the content collection and explanation very useful for the students
Yeah u r doing great ma'am . thanks a lot From Kolkata
It's really good mam.... I can understand the heap...... tq so much mam😉
Mam you are a great lecturare
In this world
Mam you are the best you teach me and i got 30/26 and topped in my class really you are.the best teacher
Mam Thank you so much.
You are really really a very good teacher 👌
Very well explained 👌👌
Amazing teaching, thank you
U explain it clear!!!! 👑👑👑🎓
Respect!!!!!🙏🙏🙏. Thank you ma'am.
last step is just like array sequential representation of binary tree in deletion of element in heap
Ma'am Thank u so much!!!! I understood the entire concept....
Superb face to you and lecture mass💙🔥
Thank you mam❤ from Sri Lanka
Superb explanation
the implementation of the above explanation in cpp (creating a maxheap and deleting all elements one by one
#include
using namespace std;
int maxheap(int arr[], int n, int a)
{
n++;
arr[n] = a;
int i = n;
int parent;
while (i > 1)
{
parent = i/2;
if(arr[parent] < arr[i])
{
swap(arr[parent],arr[i]);
i = parent;
}
else
{
return 0;
}
}
return 0;
}
int dele(int arr[],int n)
{
cout
Thank you 😊
Great Thanks
@@sijalfatima7043 :)
@@an_son_mathew_ :)
wrong