@@vikasgupta3635 I think it depends on whether you take h of root node to be 0 or 1. If you take it as 0, then it is as ma'am said (2^(h+1))-1. If it is 1, then (2^h)-1
Never experienced such a great explanation ever, Mam you deserves a National Award, I am watching each and every videos on DS and I am getting such a clear concept understanding. All I need to do now is practice. I always bless my friend Abhinav who shared your channel, and regaining blessings by sharing with others. Thank you always mam. Hope to meet you in real so that I can have your blessings too.
Quite informative, by the end of all her lectures I find myself very contented in terms of knowledge and I also feel aroused, yes aroused. This lady is doing what most of the colleges are failing to do. She deserves Much appreciation.
Wonderful and very informative session. Would like to add just a small correction. At 16:16 , you mentioned "2 is to power height + 1" but the actual statement must be "(2 into h) + 1". Since the writing also looks a bit like 2^h + 1 , it might be confusing for new learners. But overall a very good video. Kudos
Mam when I saw these video ..i think it is just a video but after watching my mind was changed it is the way teach the children's now a days best lecture of the UA-cam i 💬 think .love u mam i want u r wishes❤️
Mam I am from West Bengal(India) , Your lactures are so beautiful and butiful your explanation .My all dougth are cleared. Thanks mam . (From:Aliah University:Kolkata)
Hello maam, thank you so much for your videos, I have such good idea of trees data structure. I aced an interview all thanks to you and most questions are from tree data stucture.
Hi. Greeting from Germany! I've studied CS some time ago, but I need some refreshing for all the terminology and so on. Sometimes it's a little bit difficult for me to understand (not only) Indian voices, because my English is poor. But you are so friendly and you explain it so well, so I'm getting that refreshing from you now. Thank you for those nice lectures! There was one thing in this one that is a little confusing, though: When you count the max. number of nodes, you should also count the root node, right? Then you would end up with 15 instead of 14 (which is also what 2^(h+1)-1 would say).
Yes there is a correction at 7:30. The sum will be 15 including the root node and also at 5:42 the value there should be 1 instead of 0 as 2^0 computes to 1.
Thank you so much mam, but according to Narsimha Karumanchi's book "Data structures and algorithms made easy" - Strict binary tree and full binary tree are different. In strict binary tree each node has exactly two children or no children but in full binary tree each node has exactly two children and all leaf nodes are at the same level.
You know I feel your channel is kinda under-rated The lectures are good, (good for a viva prep.) , I thought that views here would be like near 0.5~0.6M at-least (new here) if you add codes and some Q, related to topic, then I think the views might shoot up ?
Hi dear, Ma'am Mashallah You're doing very well for all of us, i see that their is no video about recursion I just want to overview it because tomorrow is my exam anyway i just wanna let you know if you miss it in any case. Thanks.
I am from ECE when I am free I learn some good stuff from your lectures such an easy way of explanation about topics but I listening to your videos at 1.75 playback speed
I have seen Ur first lecture of tree the way u teach is great🙏 I m surprised to see Ur lecture bcz I m searching for the best video on UA-cam n Ur lecture is super b🙏🙏
Mam it's very difficult to concentrate on your teaching bcz of your cuteness..❣️...mam, you're so cute and I'm watching from Lovely Professional University mam
I think here we need depth instead of height. Because height is the longest distance from the leaf node to that node and depth is distance from root node to that node
@ 7:45 at the level 0 , we have 1 node but mam has written it as 0 node. When we calculate 2 power i ...that means 2 power 0 is 1 and while adding those nodes also, mam took it as 0 ...😶😶is my explanation and doubt correct
in this video , there is a concept where u explain that how to calculate max. no of nodes possible at any level ( by 2^i ) but how to calculate min no of nodes possible at any level ?
As far as I know there is no point of calculating min no of nodes... is there?? I guess min nodes can be either 1 or 2 according to type of binary tree..
In this era where girls are easily getting popularity by showing their body in Tiktok or Reels. See such daughters who are working so hard to teach other for free. You deserve national award for this and you should be famous. You are basically motivator, role model and ideal for many. Thanks for being here. You are the proof genuinity still exist. God bless you mam. I wish you get all happiness in the world
mam your explaination is good but there are few corrections like no nodes formula, full binary tree and strict binary tree are not same. in strict binary tree each node has 2 nodes or no node and in full binary tree each node has exactly 2 nodes and all leaf nodes are at the same level
Mam can you please confirm. At many places it is being shown that height of the tree for n number of maximum nodes is floor(logbase2(n)). And over here you are telling it should be ceil(logbase2(n+1) - 1). It is creating a lot of confusion.
CORRECTION: at 5:42 there should be 1
at 7:30 the sum will be 15
I think 8:21 Maximum number of nodes in a binary tree of height 'h' is {(2^h )- 1}.plz clarify
@@vikasgupta3635 I think it depends on whether you take h of root node to be 0 or 1. If you take it as 0, then it is as ma'am said (2^(h+1))-1. If it is 1, then (2^h)-1
2 to the power of 0 should be 1, isn't it?
@@xiaoliliu6301 yes
@@vikasgupta3635 No, (2^h+1)-1.
Half of my engineering is dependent on you 💛
the other half on covid
@@ojasraj2868 😂
🤣🤣🤣
Very true
And half my engineering got ruined cause of her 💦
Never experienced such a great explanation ever, Mam you deserves a National Award, I am watching each and every videos on DS and I am getting such a clear concept understanding. All I need to do now is practice. I always bless my friend Abhinav who shared your channel, and regaining blessings by sharing with others. Thank you always mam. Hope to meet you in real so that I can have your blessings too.
🤭🤭🤭🤭
Itna emotional hone ki kya baat he🤭
@@sourabhbharadwaj4522 yr makhan bhi toh lagana hai ma'am ko😅🤭
Quite informative, by the end of all her lectures I find myself very contented in terms of knowledge and I also feel aroused, yes aroused. This lady is doing what most of the colleges are failing to do. She deserves Much appreciation.
Wonderful and very informative session. Would like to add just a small correction. At 16:16 , you mentioned "2 is to power height + 1" but the actual statement must be "(2 into h) + 1". Since the writing also looks a bit like 2^h + 1 , it might be confusing for new learners. But overall a very good video. Kudos
Seriously my day starts with Jenny mam lectures thanks you mam
Mam I really loved your sorting videos they cleared the concept.
You are a motherly figure who helped me alot but never knew me.
Placement lagi ?
Awesome explanation !!! There were many loopholes in my previous fundamentals of these topics , got them all cleared. Thanks for the quality videos !!
Mam plz continue Ur lecture bcz it helps the economical weaker section of students who don't afford money to buy the courses of gate 👍
yess
In 2nd yr,I used to watch ur vdo,these helps me a lot.last word from my side,u r great teacher.and beautiful also☺
I can't explain how precious you are for us keep helping us!!!!
I'll be having exam of Data Structure in this coming week I was having doubts in trees but now my mind has been cleared now thnx a lot nd keep jt up👍
in just two videos, you got everything. Strange :-)
@@goyaldeekshant chronology samjho
ua-cam.com/video/rGuomOW-aCc/v-deo.html
Mera final exam hai kal aur mai abhi dsa ki video dekh rha :[
Mam when I saw these video ..i think it is just a video but after watching my mind was changed it is the way teach the children's now a days best lecture of the UA-cam i 💬 think .love u mam i want u r wishes❤️
I had completed my exam on this day and written well because of you mamm thank you very much mamm
Methodology to deliver concept is amazingly understandable!
Appreciation from Pakistan ♥♥
Its been fortune to have a great
Teacher like u man, that to free of cost thank u
height of tree == height of root node.
correction 16:16 --> 2^h+1 - 1 (maximum height of Full Binary tree )
Ma'am u are the best in teaching 😉..I have no words to translate it...I understood your lecture in one go...
Really thanks for ur lections!
From Padua University, Italy :)
Very hard to concentrate in the midst of a cute teacher😅♥️
U also cute ❤️
U r ri8 buddy ,but how u get know this things
s to the i to the m to the p
ua-cam.com/video/rGuomOW-aCc/v-deo.html
We shall keep our focus comrades, don't lose the way
Your language are so clear again thank you madam... 💐
Nice teaching mam, u r explosing each and every point and making learners to understand easily.THANK U
Tq saving my supply exam ❤️ love you madam your beautiful and voice was very nice and teaching was OUTSTANDING.
Yr .....mujhe ye aata h bahut ache se but phir bhi m Baar Baar dekhta hoon aapko dekhne ke liye 😍
Thank you ma'am for making our concept rock solid !!
You've got a really methodical way of explaining things, thanks Jenny!
mam, you are one of the best computer science teacher
best mam on youtube ,total respect 100%
Appreciate your hard work...👏👏
I am able to do coding or understand only bcoz of u💕
Thankyou Maam🙏😌
So beautiful mam teaching with full dedication 😍 🙏
Really bottom of my heart .... Its really superb
- Hyderabad
i regret i did find this channel sooner 😢 amazing teaching skills :)
mam your teaching method very expensive
love u mam
Mam I am from West Bengal(India) , Your lactures are so beautiful and butiful your explanation .My all dougth are cleared. Thanks mam . (From:Aliah University:Kolkata)
I enjoy the lecture ,it is very helpful to crack the interviews
Mam maine apka age binary mai gues kiya tha😅, Mam maire Sorting algo pura clear ho gya apka videos dekhke, Thank you mam.
Thank you so much ma'am! I've expected for 'n' information but I got '2n+1' information from this lecture!
Thank you very much mam i can clarify my doubts &your teaching is very nice 😍😍
Thank you mam,i have got full Marks in DS because of you.
Party.😋
Definitely mam
Love you from Pakistan Man, Really your knowledge and the style of delivers it outstanding.
very nice lecture and completely helpful for my exam......may god rewards you
Hello maam, thank you so much for your videos, I have such good idea of trees data structure. I aced an interview all thanks to you and most questions are from tree data stucture.
a perfect lecture, Really appreciated, If you do some associated gate questions, it will be appreciated mam :)
Mam you are excellent....👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌
Thanks🌹🌹... Very useful.
Your DBMS normal forms lecture is superb... Keep up the good work.
Excellent💯.node at Level at 0=1=2^0
Helped me alot! Thanks ma'am, you are a true gem!
Lockdown me yahi dekh kar toh man lg ra hai😍😍
Thanks mam for describing easily. May be the easiest lecture I ever seen. May allah bless you with a baby girl like you.
Hi jany.
For level 3 max no of node should be 15. According to formula 2^h+1 -1.
Please correct this
She ignored the root node. 2 to the power 0 is 1, not 0.
Are bhai she wrote 2⁰ = 0 ( by mistake)
2⁰ =1 hota hai😂😂
@@budhaaasingh aata na jata gyaan jaroor bata
@@budhaaasingh yes she ignored it.
Hi. Greeting from Germany! I've studied CS some time ago, but I need some refreshing for all the terminology and so on. Sometimes it's a little bit difficult for me to understand (not only) Indian voices, because my English is poor. But you are so friendly and you explain it so well, so I'm getting that refreshing from you now. Thank you for those nice lectures! There was one thing in this one that is a little confusing, though: When you count the max. number of nodes, you should also count the root node, right? Then you would end up with 15 instead of 14 (which is also what 2^(h+1)-1 would say).
@Joh Seff I noticed that too.I think she wrote 14 mistakenly
Yes there is a correction at 7:30. The sum will be 15 including the root node and also at 5:42 the value there should be 1 instead of 0 as 2^0 computes to 1.
thanks mam you've helped me a lot in my preparation and lot of my doubts were cleared with your explanation thank you
Thank you so much mam, but according to Narsimha Karumanchi's book "Data structures and algorithms made easy" - Strict binary tree and full binary tree are different. In strict binary tree each node has exactly two children or no children but in full binary tree each node has exactly two children and all leaf nodes are at the same level.
Love the way you teach mam
You know I feel your channel is kinda under-rated
The lectures are good, (good for a viva prep.) , I thought that views here would be like near 0.5~0.6M at-least
(new here) if you add codes and some Q, related to topic, then I think the views might shoot up ?
Very Nice.
Full binary tree Minimum nodes formula is n=2*h-1.
For h=4,n=7(as per your formula). But,for h=4,n=9(you can check).
So,min. nodes=2h+1.
Wow mam ur explanation was really awesome❤❤❤
Hi dear, Ma'am Mashallah You're doing very well for all of us, i see that their is no video about recursion I just want to overview it because tomorrow is my exam anyway i just wanna let you know if you miss it in any case. Thanks.
thanku ma'am... the way u teach is too good...alwys keep helping us.... thanks a lot ma'am..
Nicely explained each topics
Thanks mam
Each point clear explanation
Thank you mam😊
Really you are too good mam can you please provides your lecture on DBMS
will start DBMS series after completing DS.. I am working on it..
I am from ECE when I am free
I learn some good stuff from your lectures
such an easy way of explanation about topics
but I listening to your videos at 1.75 playback speed
I have seen Ur first lecture of tree the way u teach is great🙏
I m surprised to see Ur lecture bcz I m searching for the best video on UA-cam n Ur lecture is super b🙏🙏
you are my data structure world❣
Thanks mam mera confusion clear ho gaya hai.... binary tree ka..
Tq for all of this mam i learn data structures from you only.
Mam it's very difficult to concentrate on your teaching bcz of your cuteness..❣️...mam, you're so cute and I'm watching from Lovely Professional University mam
Underrated channel
I think here we need depth instead of height. Because height is the longest distance from the leaf node to that node and depth is distance from root node to that node
@ 7:45 at the level 0 , we have 1 node but mam has written it as 0 node. When we calculate 2 power i ...that means 2 power 0 is 1 and while adding those nodes also, mam took it as 0 ...😶😶is my explanation and doubt correct
in this video , there is a concept where u explain that how to calculate max. no of nodes possible at any level ( by 2^i ) but how to calculate min no of nodes possible at any level ?
As far as I know there is no point of calculating min no of nodes... is there?? I guess min nodes can be either 1 or 2 according to type of binary tree..
amazing explanation mam!
I must leave a comment.... You're awesome... Thank you so much for your channel...
I didn't realize teacher will be this beautiful untill I saw you mam
P. S :- great explanation mam
At time 16:18 there should be (2*h+1) minimum number of nodes in a full binary tree instead power of 2 plus 1.
Please correct me if i am wrong.
Thanks
Yes bro
U are correct
I had the same doubt
right
Yes you are correct (2*h + 1) is minimum
In this era where girls are easily getting popularity by showing their body in Tiktok or Reels. See such daughters who are working so hard to teach other for free. You deserve national award for this and you should be famous. You are basically motivator, role model and ideal for many. Thanks for being here. You are the proof genuinity still exist. God bless you mam. I wish you get all happiness in the world
Mam your classes are very helpful in my preparation .tq mam
you are just making difference thank you.
nice ❤️ but 2° = 1 not 2°=0
mam your explaination is good but there are few corrections like no nodes formula, full binary tree and strict binary tree are not same. in strict binary tree each node has 2 nodes or no node and in full binary tree each node has exactly 2 nodes and all leaf nodes are at the same level
16:16 it should be 2*h+1 and not 2^h+1
More helpful lectures dear mam😍😍
Thanks mam, wonderful lecture. Just a small request in the last you leave the blackboard so we can capture the screen and save.
Very good lectures
I love you mam 😍 ...
Mam can you please confirm. At many places it is being shown that height of the tree for n number of maximum nodes is floor(logbase2(n)). And over here you are telling it should be ceil(logbase2(n+1) - 1). It is creating a lot of confusion.
while(1>0)
{
printf("Thankyou soo much mam😃");
return 0;
}
Thank you mam❤❤ for such a grateful video
thanks you so much for sharing this video I understand binary tree now, keep it up my engineering
Mam 2^0 value is 1,You can say it's 0 ,so it's was one mistake then all are good..👍
Mam level 0 Maximum no of node is 2^0=1 .
All lecturing videos are good
I think 8:21 Maximum number of nodes in a binary tree of height 'h' is {(2^h )- 1}.
no its 2^h+1 -1 because power is number of terms . here we include 0 as well so h+1
Yuupp. really helpful... Love from Pakistan 🥰🥰🌷
Hello Maam, Thanks for sharing your knowledge🤩
Thank you so much madam...excellent guidance
Simple and good explanation
love you help me alot in my semister
I am waiting for the day her channel would be sponsored and we would regret . And each video would cost us bills. Coz she teaches so well.