Test If A Binary Tree Is Height Balanced ("Balanced Binary Tree" on LeetCode)

[@BackToBackSWE]

Table of Contents: The Problem Introduction 0:00 - 0:33 Cases That Are Height Balanced 0:33 - 1:56 Cases That Are NOT Height Balanced 1:56 - 2:58 Approach #1: Get Heights of Subtrees At Each Node 2:58 - 3:46 Approach #2: Recurse To Base Cases 3:46 - 4:23 Walkthrough of The Recursion 4:23 - 12:39 Time Complexity 12:39 - 13:25 Space Complexity 13:25 - 13:39 Wrap Up 13:39 - 13:57 The teacher's notes contain a link to the code for the problem discussed in the video. It is fully commented for teaching purposes strictly.

[@dolcyrao5763]

You're really amazing, I was enjoying your teaching. Thanks a lot for this high-quality teaching for free.

[@BackToBackSWE]

great to hear!!!

[@anthonysummit3098]

Where is the code?

[@sivaprakashkkumar9691]

Where is code

[@debanjanasantra6724]

Could not find the link to the code :(

[@BismaSuleman]

Me on Tinder: Hey, what is your height? And are you balanced?

[@BackToBackSWE]

ye

[@ExplorerSpace]

@@BackToBackSWE i am average height

[@johnpaul4301]

Balanced here might mean whether your tootsiroll matches your height

[@WyMustIGo]

@@johnpaul4301 kzbin.info/www/bejne/opPRoHpomdiIoZI

[@stephyjacob1256]

Sharing this channel to all my friends who are interested to learn data structure algorithm .. Please make more videos on Data Structure and algorithms .. Believe me nobody tech like you. This channel has potential to become one of the best. The difference between you and others, is that most people just jumps directly into the solution but you tell us 'the thought process', 'how to interpret the problem' which are most important. Your think loud approach is best part. Please don't stop making such video. People like me are always with you.

[@BackToBackSWE]

Haha thanks

[@baraaabuasal5626]

yes!!

[@rban123]

Better than my data structures professor, thank you

[@BackToBackSWE]

thx

[@josephwong2832]

asking the "critical question" and then returning the answer to that question to my parent is a great way to reason about recursion in general your teaching style sir is on another level!!!

[@BackToBackSWE]

thanks!

[@nikhilkumarmishra1225]

OMG the way you explain the idea behind why the algorithm works, it just blew me away. Thanks a lot mate!

[@BackToBackSWE]

wassup

[@turnuptheMIKEG]

you're a remarkable teacher. blew my PhD data structures professor out of the water, honestly. thank you for making these videos. I'm surviving interview season bc of this.

[@BackToBackSWE]

lol nice, sure sure, they are a relic of the past self. I don't even remember recording some of these. Nice nice, you'll make it yo

[@psthakur1199]

Loved that idea of "asking a question".Thanks man!!

[@BackToBackSWE]

ye

[@rakhman8621]

The way you explain everything man…the number of times you revisit some moments is perfect, the speed with which you explain the material is perfect. Keep up the good work and thank you for teaching us such important topics in such a great way.

[@adityajain-fn6ne]

You deserve way way more recognition and credit for the work you have done sir! better than any college professor I have had.

[@BackToBackSWE]

thanks and thx

[@rahoolification]

What you are doing is nothing short of humanitarian work my friend!

[@BackToBackSWE]

ye

[@priyogopalsingha3487]

undoubtedly, the best explanation of how recursion works in trees

[@adenosinetp10]

why this has so less views??! No one these days teaches like this guy...not even my professor does....this video helped me creating a foundation for my data structure course

[@BackToBackSWE]

ye

[@PherricOxide]

Thanks for the videos! They're very well done compared to most of the others where people either start writing code immediately or jump straight to the solution without explaining how they got there.

[@BackToBackSWE]

Sure, this channel still has a long way to go

[@ruthylevi9804]

you are so gifted at teaching, never stop!

[@MuhammadIrshadAli]

Man, you should train CS professors at universities on how to teach algorithms

[@BackToBackSWE]

nah

[@afsinyilmaz8665]

great way of explaining stuff...Keep up the good work...you folks are as valuable as nation's best teachers.

[@kunpeng8646]

What a smart and attractive illustration, well-done man!

[@BackToBackSWE]

thanks

[@Don_ron666]

Finally a clear cut video good job!

[@BackToBackSWE]

thanks

[@deepamkumar5211]

Your explanation is the best i have ever seen and really helps to understand these difficult problems. I appreciate your selfless work and the dedication with which you teach us these topics..Got to learn a lo from you,keep uploading more videos and soon this channel would turn out to be the best resource for interview preparation.

[@BackToBackSWE]

thx

[@johnmcway6120]

Thank you very much. I myself teach myself to code, I'm also a teacher in kindergarten. I recognize a lot of myself in you. Keep up the good work!

[@BackToBackSWE]

Nice! thanks!

[@hugenerretho9151]

ur explanation is so concise that my golden retriever can now display his treats in tree structure

[@BackToBackSWE]

Thank you, glad you liked it 😀 Do check out backtobackswe.com/platform/content and please recommend us to your family and friends 😀

[@realmarciomarinho]

You said the code was below, but I cannot find it.

[@wowzande]

That's gangsta as fuck we need more of this

[@BackToBackSWE]

haha

[@HemanthaKumarYadav]

I am so glad that I found your channel on KZbin...! Thank You very Much Sir!

[@BackToBackSWE]

welcome

[@ahiduzzamanahir1338]

WHAT! Did you just teach me recursion? I thought it was impossible!

[@kevinandres3306]

EXCELLENT explanation. extremely clear

[@BackToBackSWE]

thanks, I like you

[@wellingtonzane4288]

Really detailed and clear explanation! Thank you!!!

[@BackToBackSWE]

sure

[@doruwyl]

Very cool approach with the nodes which are "bellow sea level". 😊

[@BackToBackSWE]

hahaha

[@リンゴ酢-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 no more than 1.

[@maripaz5650]

Best interview prep ever :)

[@BackToBackSWE]

thanks

[@SOURAVKUMAR-tw3ds]

awesome work bro!! helped a lot in visualization of recursion calls

[@missrockinout]

you get so into explaining this, gotta love the head scratch lmao thanks for an awesome explanation :D

[@BackToBackSWE]

lol wut

[@quirkyquester]

Thank you man! This video really helps me to understand the process of solving the problem.

[@BackToBackSWE]

sure

[@nandanimadhukar]

Awesome explanation! Trees are speaking for themselves :D

[@BackToBackSWE]

ye

[@ggzz8845]

where is the code ?

[@TheAntloo]

Awesome walkthrough! Gave me a nice intuition on how I would write the code. Do you think you could make a video on how to insert a node into a BBST?

[@BackToBackSWE]

Nice. and maybe.

[@ramizrizwan3057]

Such a good explanation, you’re the best!

[@BackToBackSWE]

Happy Holidays! Really glad to help 🎉 Do you know about the BacktoBackSWE 5 Day Free Mini Course? Check it out here - backtobackswe.com/

[@aatifnazar1766]

The node which is marked red cross will not return 2. It breaks the call there only.

[@BackToBackSWE]

ok

[@TacklessNebula3]

Made your 2K to 2.1K... Thanks for the brief explanation!

[@max500k]

Great job! You explained this well

[@saikatdutta1991]

Hey bro, I want you to explain "Median in a stream of integers (running integers)" this problem. I am unable to understand why we need to use self balanced binary tree to solve this problem. Thanks. I will be helpful.. You explain better than any other.

[@BackToBackSWE]

I'll be covering that in my class but not on the channel, most of my technical videos will go there now. I'm going to convert the channel into a more "I'm building things" type thing soon

[@sankethb.k642]

Thank you very much sir, your channel will soon be on the top.

[@BackToBackSWE]

thanks

[@malaguna66]

This explanation is so clear so good!

[@BackToBackSWE]

glad it helped

[@hinocenciopaulo]

Thank you so much for this beautiful explanation 🙏

[@neghatnazir1668]

awesome explination , i love the way you explain things.

[@BackToBackSWE]

thx

[@baraaabuasal5626]

at 6:00 I was like, say no more => Subscribed. fkn love the way explain stuff man

[@ShortGiant1]

Great video, thanks. Appreciate the table of contents.

[@BackToBackSWE]

May you flourish

[@rhiannonsmeby9566]

This video was fireeee I hate recursion but this visualization and explanation really helped

[@amitmishra2736]

Dude! I am not seeing the code in the down :( could you please update the Link

[@BackToBackSWE]

The repository is deprecated - we only maintain backtobackswe.com now.

[@intoeleven]

the time complexity is wrong, it should be O(n*log n), n is for getting height for each node and you need to check every node for balanced is log n. The worst case could be O(n^2) in this top-down solution, actually.

[@BackToBackSWE]

If the tree is skewed height checking is O(n)

[@intoeleven]

@@BackToBackSWE Yes, and you not only check the height, but also check the balanced, which will cost O(log n). The total time complexity should be O(n log n) leetcode.com/problems/balanced-binary-tree/solution/

[@fantasy9960]

wow, your teaching is amazing! thanks again!

[@wappa6914]

Thank you from France !

[@BackToBackSWE]

sure! 🇫🇷

[@MoscleBrog]

people like u save students like us😃

[@randalllionelkharkrang4047]

if it has to fail, it will always fail at the root node right? can you provide with a counterexample to what I said?

[@abbasjradi5001]

Exactly, it doesnt wkrk

[@yuyu-qr7ih]

very detailed explaination brada love u

[@BackToBackSWE]

sure homie

[@neotong9885]

really nice job on explaining Balanced Binary Tree!

[@BackToBackSWE]

thanks

[@pushkalkatara2153]

Hey, really a great explanation man! It'd be awesome if you could whiteboard the pseudocode too after the explanation.

[@BackToBackSWE]

yeah good idea

[@syedmdharris8814]

we can simply check whether each node has left and right node? can you explain about that

[@wahtthepho]

excellent explanation!! thank you!

[@mohannadbayoumi9686]

May I ask what the complexity of the non-efficient way you mentioned in the beginning of the video is?

[@BackToBackSWE]

Quadratic O(n^2)

[@超级小棕熊0]

thank you much ,I totally uderstand how recursion work

[@BackToBackSWE]

nice

[@abhishekk.3977]

Ok, I accept that I agreed to max(0,0) = 1. @ 8:40

[@BackToBackSWE]

ok

[@ashwanigupta4672]

Finally got an awesome explanation 🏆

[@Kellworkie]

Amazing teaching!

[@hikemalliday6007]

this dude kills it

[@qingruxia6312]

I love u your videos so much! Thank you so much for your time and work!

[@researchandbuild1751]

Could you just do a breadth search and if the count of children at a level count is odd, it is not balanced?

[@BackToBackSWE]

How would this work exactly?

[@researchandbuild1751]

@@BackToBackSWE well it seemed like possibly a feature of an unbalanced binary tree is it would have a level with non-even count of nodes. Unless i am misunderstanding what a balanced tree should look like (which is possible). So you just make a queue and walk down the nodes, pushing children at each. If your total count of children in the queue is ever odd at each step then you know the tree is unbalanced. Not sure if that would work or not though, just pondering

[@MahmoudSayed-hg8rb]

I'm kinda late idk if you'll respond to this comment first of all thanks for your efforts. second thing ... as far as I know ( and i almost know nothing yet, I'm just a beginner), something doesn't add up in the last example Dont we consider a tree a Balanced tree if the absolute difference of the heights of each side is

[@khan.mansoor]

Great explanation! Do you have a link to the code for this problem that I can refer to?

[@eliasmoreno4672]

you explained this so well. wow. *subscribed :)

[@BackToBackSWE]

thanks!

[@pawanacharya997]

How can someone explain this clearly wow you really helped me.. thanks

[@BackToBackSWE]

nice

[@shruthiranganatha7333]

Why add 1 to max(heightOfRightNode, heightOfLeftNode) ?, Wha's the logic here??

[@BackToBackSWE]

Including the node that the call is working on in the height as the calls go up

[@techzoo1]

Your explanation is somehow kinda funny (in a good way)!

[@BackToBackSWE]

yeah I was weird when the channel started. no one was watching

[@stargazer8718]

What's the difference between this and an AVL tree?

[@ashishbisht980]

Bro you are awesome , love from India

[@BackToBackSWE]

much love

[@pewdiepieschair2693]

thanks lad, much appreciated!

[@SreyesSrinivasan]

Great explanation, thanks a lot :)

[@mpalanipsbb]

Best explanation!

[@AllNaturale11]

very helpful. thank you!

[@BackToBackSWE]

Thank you! Please enjoy a special code from us - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=AllNaturale11 🎉

[@RedRabbitII]

love this! thank you

[@jgraiver]

have you done the code for this anywhere?! loved the video

[@BackToBackSWE]

I think so here: github.com/bephrem1/backtobackswe

[@shijames4129]

nice video!!! thanks!!

[@BackToBackSWE]

sure

[@ifelsedeveloper]

hey! love your videos! one question, can't i just check the absolute height difference from each node? without asking are you balanced to each node?

[@BackToBackSWE]

Yes but that will duplicate subtree measurements

[@ashwinvarma9349]

Dude please include in your videos bro that would be of great help!

[@aatifnazar1766]

A big thank you for this content

[@BackToBackSWE]

thanks for being here

[@sameerpatel3476]

Would a tree be considered balanced tree if the root have only one node at one side ?

[@cocoarecords]

My goto channel for any problem

[@BackToBackSWE]

hey

[@shashankshekhar390]

That helped, thanks.

[@BackToBackSWE]

sure

[@PankajKP]

i hav to pause the video and say GOD to you.... You are GOD!!!!! 😇😇

[@BackToBackSWE]

i try, i try

[@nishanth998]

where can i find the code in the website??plz tell me

[@BackToBackSWE]

The repository is deprecated - we only maintain backtobackswe.com now.

[@darshantsdarshan1]

This guy is awesome 👏

[@BackToBackSWE]

I'm ok.

[@XLpacman805]

Thanks

[@zackyang123]

That 8:40 zoom is gold hahahaha

[@BackToBackSWE]

what did I do

[@maidul13]

I just don't get why its max(-1,-1)+1, is that supposed to be equivalent to taking absolute value? if so can you explain please

[@BackToBackSWE]

I am just simulating the code as it would execute the base case.

[@poojaguru2516]

Lifesaver : ) Thank you so much!! Best explanation ever!!

[@BackToBackSWE]

sure

[@lucy2003-d8p]

great work brother

[@wentingzhang3097]

I'm having trouble finding the code in the description! :(

[@BackToBackSWE]

The repository is deprecated - we only maintain backtobackswe.com now.

[@salwaabdullah2003]

Thanks 🙏

[@BackToBackSWE]

sure

[@kimmyliu5509]

May I ask where is the code? you mentioned it is in description but it is not...

[@BackToBackSWE]

Do check out backtobackswe.com/platform/content