5.2 Binary Tree in Data Structure| Types of Binary Tree| Data Structures Tutorials

[@JennyslecturesCSIT]

CORRECTION: at 5:42 there should be 1 at 7:30 the sum will be 15

[@vikasgupta3635]

I think 8:21 Maximum number of nodes in a binary tree of height 'h' is {(2^h )- 1}.plz clarify

[@alexroy7155]

@@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

[@xiaoliliu6301]

2 to the power of 0 should be 1, isn't it?

[@KK-hd4wy]

@@xiaoliliu6301 yes

[@justcurious1940]

@@vikasgupta3635 No, (2^h+1)-1.

[@jaybhati5603]

Half of my engineering is dependent on you 💛

[@ojasraj2868]

the other half on covid

[@sravantipris3544]

@@ojasraj2868 😂

[@sudhanshukandwal3543]

🤣🤣🤣

[@pratiushkumar3306]

Very true

[@wrad69]

And half my engineering got ruined cause of her 💦

[@shadidalam2431]

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.

[@nivinmathews428]

🤭🤭🤭🤭

[@sourabhbharadwaj4522]

Itna emotional hone ki kya baat he🤭

[@Riya-zv9ck]

@@sourabhbharadwaj4522 yr makhan bhi toh lagana hai ma'am ko😅🤭

[@madhupathireddy6357]

Seriously my day starts with Jenny mam lectures thanks you mam

[@tikendraw]

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.

[@nehasupriya2867]

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 👍

[@bthulasikrishna9597]

yess

[@aafhanjaved1859]

Mam I really loved your sorting videos they cleared the concept. You are a motherly figure who helped me alot but never knew me.

[@akgamer842]

Placement lagi ?

[@parth8044]

Awesome explanation !!! There were many loopholes in my previous fundamentals of these topics , got them all cleared. Thanks for the quality videos !!

[@princeverma-or7nc]

I can't explain how precious you are for us keep helping us!!!!

[@kabaliprogaming7480]

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 KZbin i 💬 think .love u mam i want u r wishes❤️

[@shivampulast4004]

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👍

[@goyaldeekshant]

in just two videos, you got everything. Strange :-)

[@princechaudhary1518]

@@goyaldeekshant chronology samjho

[@gxeducation7540]

kzbin.info/www/bejne/qHjYoKCFjJKUecU

[@yatinkhajuria1564]

Mera final exam hai kal aur mai abhi dsa ki video dekh rha :[

[@sivaprasad16]

I had completed my exam on this day and written well because of you mamm thank you very much mamm

[@charan.a1729]

Its been fortune to have a great Teacher like u man, that to free of cost thank u

[@usmanhaider4980]

Methodology to deliver concept is amazingly understandable! Appreciation from Pakistan ♥♥

[@codewithcliffton7711]

Ma'am u are the best in teaching 😉..I have no words to translate it...I understood your lecture in one go...

[@kameshwarmehta8435]

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☺

[@canny891]

Really thanks for ur lections! From Padua University, Italy :)

[@subarthin4165]

Very hard to concentrate in the midst of a cute teacher😅♥️

[@dharmasamikeri2707]

U also cute ❤️

[@devgaming4045]

U r ri8 buddy ,but how u get know this things

[@enjigaming11]

s to the i to the m to the p

[@gxeducation7540]

kzbin.info/www/bejne/qHjYoKCFjJKUecU

[@pranavpatel6372]

We shall keep our focus comrades, don't lose the way

[@shubhamsoni9704]

Your language are so clear again thank you madam... 💐

[@kannankannank]

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

[@middleverse3838]

You've got a really methodical way of explaining things, thanks Jenny!

[@sushmavalliboina5757]

Nice teaching mam, u r explosing each and every point and making learners to understand easily.THANK U

[@rajatkumar5374]

Yr .....mujhe ye aata h bahut ache se but phir bhi m Baar Baar dekhta hoon aapko dekhne ke liye 😍

[@shreechatane9215]

Thank you ma'am for making our concept rock solid !!

[@anupamtiwari0019]

Thank you mam,i have got full Marks in DS because of you.

[@JennyslecturesCSIT]

Party.😋

[@anupamtiwari0019]

Definitely mam

[@Raviteja-xe4ep]

Tq saving my supply exam ❤️ love you madam your beautiful and voice was very nice and teaching was OUTSTANDING.

[@gorrepatimadhu6025]

I am able to do coding or understand only bcoz of u💕 Thankyou Maam🙏😌

[@shubhambangar8202]

mam, you are one of the best computer science teacher

[@VinayTiwari-gn3ps]

mam your teaching method very expensive love u mam

[@Cricketmusic717]

best mam on youtube ,total respect 100%

[@m.mohamedhakeem5298]

i regret i did find this channel sooner 😢 amazing teaching skills :)

[@pythoncodewithdeepak9703]

I enjoy the lecture ,it is very helpful to crack the interviews

[@anurajsingh8137]

Mam maine apka age binary mai gues kiya tha😅, Mam maire Sorting algo pura clear ho gya apka videos dekhke, Thank you mam.

[@ismailguda5012]

very nice lecture and completely helpful for my exam......may god rewards you

[@nagulbaskar5952]

Thank you so much ma'am! I've expected for 'n' information but I got '2n+1' information from this lecture!

[@jayasmultichannel4933]

Thank you very much mam i can clarify my doubts &your teaching is very nice 😍😍

[@JavaAidTutorials]

Appreciate your hard work...👏👏

[@sauravchaudhary6283]

Lockdown me yahi dekh kar toh man lg ra hai😍😍

[@naveenamour9015]

Really bottom of my heart .... Its really superb - Hyderabad

[@farhadahamed6264]

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)

[@devanshgore5769]

So beautiful mam teaching with full dedication 😍 🙏

[@giduthurijyothiswaroop5414]

thanks mam you've helped me a lot in my preparation and lot of my doubts were cleared with your explanation thank you

[@kamleshkumarsuman8090]

Excellent💯.node at Level at 0=1=2^0

[@santanuphukan5538]

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.

[@muhammadrizwan4879]

Love you from Pakistan Man, Really your knowledge and the style of delivers it outstanding.

[@Riyad355]

Thanks mam for describing easily. May be the easiest lecture I ever seen. May allah bless you with a baby girl like you.

[@sayanidhar7020]

Mam you are excellent....👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌👌

[@akshaygoyal3782]

Hi jany. For level 3 max no of node should be 15. According to formula 2^h+1 -1. Please correct this

[@budhaaasingh]

She ignored the root node. 2 to the power 0 is 1, not 0.

[@pro_pranay]

Are bhai she wrote 2⁰ = 0 ( by mistake) 2⁰ =1 hota hai😂😂

[@pro_pranay]

@@budhaaasingh aata na jata gyaan jaroor bata

[@ranjiniramachandran629]

@@budhaaasingh yes she ignored it.

[@bidishapandit7001]

Helped me alot! Thanks ma'am, you are a true gem!

[@nidhikumari1479]

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.

[@VISHALKUMAR-kg7nt]

Thanks mam mera confusion clear ho gaya hai.... binary tree ka..

[@944977974]

Very Nice. Full binary tree Minimum nodes formula is n=2*h-1.

[@nagame859]

For h=4,n=7(as per your formula). But,for h=4,n=9(you can check). So,min. nodes=2h+1.

[@AnujKumar-tt5md]

Thanks🌹🌹... Very useful. Your DBMS normal forms lecture is superb... Keep up the good work.

[@SarikaBankar-l1y]

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

[@rhimanshukaushal7390]

thanku ma'am... the way u teach is too good...alwys keep helping us.... thanks a lot ma'am..

[@engineeringupdates3229]

When jenny madam is here.... Then there is no fear... Of Data structures......

[@jithinmv6516]

a perfect lecture, Really appreciated, If you do some associated gate questions, it will be appreciated mam :)

[@suraarup4542]

Tq for all of this mam i learn data structures from you only.

[@ol554]

Underrated channel

[@ayushipandey7080]

Nicely explained each topics Thanks mam

[@tspscaddago3594]

Each point clear explanation Thank you mam😊

[@StudyLoom24]

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

[@KarthikRajana-db1hy]

It's 2:00 a.m still jenny lecture wakes me for tomorrow exam!!

[@johseff6460]

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).

[@ashikbillah1347]

@Joh Seff I noticed that too.I think she wrote 14 mistakenly

[@poonamsapkale8711]

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.

[@highlights3933]

Really you are too good mam can you please provides your lecture on DBMS

[@JennyslecturesCSIT]

will start DBMS series after completing DS.. I am working on it..

[@FasiWrites]

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.

[@LEANDROTL2010]

I must leave a comment.... You're awesome... Thank you so much for your channel...

[@nyanutdiing3070]

thanks you so much for sharing this video I understand binary tree now, keep it up my engineering

[@rumiNITPatna]

amazing explanation mam!

[@mananpatel6123]

you are my data structure world❣

[@ashwini14131988]

All lecturing videos are good

[@honeymanee8660]

Wow mam ur explanation was really awesome❤❤❤

[@eswarroy8093]

Mam your classes are very helpful in my preparation .tq mam

[@nagulbaskar5952]

Hatsoff for brief lecture!

[@ashwini14131988]

Simple and good explanation

[@poisonperson6676]

love you help me alot in my semister

[@devilsingh1910]

There is mistake in calculating nodes ...(at 0lever there would be 1 node not 0) and mistake i height too

[@barchilsaid3001]

I agree with this 2 power 0 is 1.

[@shramarashika566]

Ya ...I am also thinking about it

[@anwarsheik3329]

Yes there is a mistake made by mam maybe she confused 😕

[@pavansai6266]

Mam 2^0 value is 1,You can say it's 0 ,so it's was one mistake then all are good..👍

[@bharathdynamo9351]

while(1>0) { printf("Thankyou soo much mam😃"); return 0; }

[@gurupreetsingh8347]

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 ?

[@JennyslecturesCSIT]

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..

[@anwarsheik3329]

I didn't realize teacher will be this beautiful untill I saw you mam P. S :- great explanation mam

[@Ankita_Singh749]

Mam level 0 Maximum no of node is 2^0=1 .

[@alixaprodev]

you are just making difference thank you.

[@srfrz_nazik]

nice ❤️ but 2° = 1 not 2°=0

[@dhanush_reddy]

U r awesome mam.... And explain is good mam...

[@sandeepk1392]

Thank you so much madam...excellent guidance

[@sharonshekar7594]

your lectures are great,but PS: Please take the lectures with a smile...don't stare..NOT TO HURT JUST A HUMBLE REQUEST..Sorry if it hurts you...i love your way of teaching

[@sripadmetpelly7149]

thanks a lot mam.Your lecture helped me a lot

[@metalichavhan7579]

Thank you mam❤❤ for such a grateful video

[@yusufbunde5756]

You are doing a good job

[@kavyag6326]

Hello Maam, Thanks for sharing your knowledge🤩

[@nagendharrao9707]

Very good lectures I love you mam 😍 ...

[@asawari520]

Very well explained !

[@hauteswan2541]

Very helpful lecture! Thank you Miss Jenny!

[@rajorshibhattacharya1542]

Thank you so very much.... The video was really awesome and helpful...

[@prajalsangle1807]

Useful for NET

[@shanmugapriya7554]

Thank u so much Ma'am. Awesome explanation,lovely and sweety..

[@sagarshekhar6296]

Can you bit explain why ceiling of log(n+1)-1 is considered?

[@AmanKumar-kz1rn]

Thank you maam ..... It,s really help me to clear my doubts

[@nehasupriya2867]

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 KZbin n Ur lecture is super b🙏🙏