What is Balancing a binary tree and why do we need balancing

[@siddarthamareedu4107]

Hi tanmay Bhaiya i just can't thank you enough for your efforts for this most efficient DSA playlist course.No one and i mean it even paid courses don't have as much detailing as your videos please keep up with the good work and thanks a lot

[@SimpleSnippets]

Thanks buddy! Please do share the videos and our channel with your friends if you want to genuinely support me & our channel!✌😇 With your support I can keep making many more such educational videos FREE for everyone!

[@jonessajan1218]

I have finished the full playlist please upload fast

[@Aakash983]

This guy is a saviour

[@リンゴ酢-b8g]

A balanced binary tree, also referred to as a height-balanced binary tree, is defined as a binary tree in which the height of the left and right subtree of any node differ by not more than 1.

[@fr33s7yl0r]

Height of a tree is not the number of edges, but the maximum depth of the elements. If tree has only a root then the height is not 0, it is 1. Similarly on your diagram the N7(32) height is 4, but not 3

[@whimsicalkins5585]

Nice explanation

[@talhan9235]

Good to see another video added to the playlist. 🙌

[@SimpleSnippets]

More to come!

[@ИтгэлсайханЭ]

Mr. You are such a BRILLIANT TEACHER. Just great prepared video and systematic explanation. Thank you for noble work.

[@SimpleSnippets]

Thank you for the kind words 😊

[@LaysaBit]

You teach very well! Thank you! You taught me what I needed

[@ritendrapal3743]

hello sir, when you add graph data structure tutorial in your playlist... ???

[@SimpleSnippets]

Will upload soon

[@faziluddinshaik]

Great explanation. What is the tool or device used to demo. The mouse pointer was pretty precise and steady.

[@PrashantGupta-c3m]

Nice explanation ❤

[@vinicioswentz]

What type of search would you use to scan an unbalanced binary tree?

[@Hero-qg9ch]

Any would work, no? Unless you mean which one to use to check if a binary tree is balanced or not, and then I don't think you'd use a search algorithm for that. Maybe a recursive function to check the difference height of every subtree of every node would do the trick

[@martinnjoroge6006]

What's the name of application you use for the digital blackboard

[@SimpleSnippets]

SmoothDraw4

[@manojseenivasan8854]

Next avl trees pls

[@SimpleSnippets]

Yup

[@39_hridayeshbakshi46]

please make a video on index sequential search

[@harshalrajput1596]

bhaiya threaded binary tree pe video banao please please please........... very less content is available on this topic on youtube

[@SimpleSnippets]

Will check up on this

[@39_hridayeshbakshi46]

Please make a video on index sequential search .

[@shaikhshafeen]

I also sometimes get confused with 'un' and 'im' haha. I can feel you

[@aineekhan3888]

Can you tell me about scapegoat??

[@midhunskani]

What software do u use to write on the screen ?

[@bgyt6624]

What if we get 1 - 1 =0 from both subtrees is it balanced or unbalanced..

[@ShadowSilverWolf]

As long it less than k it balance Assuem k=1 so yes

[@hasnatsaghir4296]

in it both cases have same lower bound?? correct me if I am wrong?? thanks

[@saugatkafley5153]

Hello sir also make vids on hashing table,collision ,and the graph theory ,greedy , Dijkstra . After it will be a complete playlist ❤️

[@SimpleSnippets]

As soon as possible

[@saugatkafley5153]

@@SimpleSnippets Thank you sir ! ❤️❤️

[@yousefosman8094]

Can you cover B-Trees? Its a topic I’ve struggled with understanding and implementing. Thank you for the quality content

[@SimpleSnippets]

Will try

[@prabalkumar2698]

thank u for good content

[@SimpleSnippets]

My pleasure

[@mangomango5660]

that was very helpful

[@blastinnn]

tnx boroo helped

[@dsa_master]

thank you,really helpful.

[@ManishSharma-fi2vr]

Awesome!

[@SimpleSnippets]

Thank you! Cheers!

[@rashitiwari7595]

💥

[@expert77]

❤

[@manjeshyadav4815]

i waste my 25:38 mins in this video

[@pookachu64]

Awful presentation.