How to solve (almost) any binary tree coding problem

🔴 Learn graph theory algorithms: inscod.com/graphalgo
⚙ Learn dynamic programming: inscod.com/dp_course
💡 Learn to solve popular coding interview problems: inscod.com/50problems_course
⌛ Learn time and space complexity analysis: inscod.com/complexity_course
🔁 Learn recursion: inscod.com/recursion_course
NB: This video is ad-free, you can choose to support Inside code by purchasing one of the courses above or dropping a super thanks!
NB2: Discounts of courses above are permanent
I also post content on LinkedIn (inscod.com/linkedin) and Instagram (inscod.com/instagram)

[@edy231094]

This is the most undervalued tree algorithm video. Info here is gold. Thanks man!

[@insidecode]

Thanks a lot for your comment

[@tahaather7429]

Dude what an explanation. Thank you so much, using recursion to solve binary tree problems has been a really huge problem till now

[@cakec9]

Wow. Brilliant nugget!! Literally opened my eyes to the problems I am solving!!

[@twi4458]

same😍😍

[@kwamenani7775]

I love people who make things this simple, just subscribed to your channel.

[@insidecode]

Thanks a lot!

[@iez]

This is actually an amazing piece of intuition

[@karthigeyanramesh4477]

I just wanna say, that thinking of recursion in a way where we fragment the root node made sooooo much sense. My exam is next week, thanks!

[@sergeynazarov2473]

With all respect to the author, this is trivial problems, I thought you clarify at least one of non-trivial: controlling levels of tree, controlling branches of tree, controlling nodes of tree or controlling symmethric of tree.

[@auntyBill]

Amazing way of presenting… it’s awesome

[@sonijain4399]

Thank u so so soo much man Non linear data structures were really tough for me From school to college It was tough for me to understand But now when i am preparing for a job I saw your video And u saved my life Thank u so much

[@weixiangwong2227]

thank you for this video. i'm really bad at binary trees but this way of thinking about it really helps

[@monarch2397]

u r genius...the most simple ways i see to learn this bianry tree...tysm blud

[@pyrostation678]

Thanks man, this is awesome!!

[@indraneel6601]

Give this guy a whole lot of subscribers!!!!!! I feel confident to solve tree problems.You Rock man Please Create a video how to solve graph problems.

[@insidecode]

Thanks!!

[@levidworkin851]

Hey Inside Code I loved the video! I just wanted to correct the treeHeight algorithm. It needs to return -1 if the root is None because currently with the returning of 0, the leaf nodes get a height of 1 instead of a height of 0 which will cause the resulting tree height to be 1 greater than it should be.

[@chandandigumarthy9652]

Amazing man! very helpful

[@vyankateshkulkarni4374]

great explanation sir, thank you so much

[@RR-wx8gp]

Honestly.... This video is just the best!!!

[@KGTube]

Very easy described man! Give this man a medal!

[@insidecode]

Thankss ❤️

[@ragapriyakarthikeyan3139]

This is exactly what I was looking for💥

[@TomGoo]

wow this actually helped me so much thx

[@shivansh2581]

LEGIT MAGICK!!!!! i just solved a question using this logic. SO LUCID. SO CLEAR. TO THE POINT

[@marcin-guitar]

Well, this is true for a certain kind of trees, where each node counts as equivalent. The same algorithm doesn't necessarily apply to segment trees, binary search trees, KD-trees etc. where an element's position in the tree is more important than its sole presence in the tree.

[@insidecode]

Yes it doesn't apply for all types of trees sure

[@coolkid9206]

@@insidecode do u have a similar video coming for binary search trees

[@isaacfs8995]

SUPER HELPFUL!

[@Satyamkumar19113]

Just the best idea to approach binary 🌲 questions

[@igbalajobizhikrullah465]

You just earned a new subscriber.... Spent hours searching for a simple explanation on Trees, found it in your channel.

[@insidecode]

[@procode6881]

Wonderful explaination

[@astronautonmars]

Wow! Super helpful!

[@harinijeyaraman8789]

Super helpful ! Great content

[@insidecode]

Thanks

[@prempeacefulchannel]

Wow, thats such a good approach! Thanks

[@insidecode]

You're welcome!

[@fifibishi7786]

wow very well explained, thank you sooo much!

[@insidecode]

you're welcome!

[@mdzikrullah9575]

This was the coolest explanation of complex problem ever..Thank you

[@insidecode]

You're welcome!

[@DaggerMan11]

exactly. Once you realize these complex problems all have some pretty easy-to-remember patterns that make them easier to solve, it's just a matter of knowing which pattern to apply.

[@vijayola7597]

amazing video !! please make more videos in binary trees and graphs

[@insidecode]

Okay!

[@StrangeDooropen]

OMG thank u so much !

[@curesnow6493]

Thank you so much for this video!

[@insidecode]

Glad it was helpful!

[@mdzikrullah9575]

Kindly make a similiar video on Graphs. It will be soo helpfull. Thanks

[@iezioaudi22]

THANK YOU!!

[@paulamorillasalonso3076]

Great video! I'm definetly subscribing😄

[@insidecode]

Thanks for subbing!

[@JohnDoe-yb9rg]

Will this formula work for Visible Tree Node problem? If yes, how? Thank you!

[@hangoutwithabhi]

This is super cool. Thanks 👍🏻

[@insidecode]

You're welcome

[@dhairya18]

Very sell described. Good work. Keep it up👍

[@insidecode]

Thanks!

[@paladin5d781]

simple beneficial and inspiring

[@twi4458]

Thanks we got a whole diffrent persepective of solving problem. Could you make this kinda videos for other DS also, pls

[@insidecode]

You're welcome! I'll see

[@hydromarlon4168]

Bruh. This finally makes sense.

[@decayingskulls7088]

bro just opened my mind

[@rishav2520]

It's really Awesome 🤩

[@danielapineyro1998]

MAN YOU MADE ME UNDERSTAND RECURSION, finally! Thank you so much!

[@insidecode]

You're welcome! Check the 3 hours recursion course I published recently here

[@danielapineyro1998]

@@insidecode I’ll check it out. Thank you!

[@insidecode]

@@danielapineyro1998 I don't have a video on that but I can explain it to you here, did you see in this video the function where we calculate the sum? We calculate the sum from the left, the sum from the right, and we add to them the parent's value. For your problem, you take the same function, but you just add two things, a global boolean variable output that starts at true, and a condition before returning the sum in the recursive function, that condition is: if root.data != left+right: output = False

[@insidecode]

@@danielapineyro1998 What we're doing here is that we're traversing the tree, but at each node, after calculating the sum of both subtrees, we're comparing with the parent's value, and we're setting the final output to false if they're different, we used a global variable to be able to access it from any call

[@insidecode]

@@danielapineyro1998 The code would be something like this: output = True def tree_sum(root): global output if root is None: return 0 else: left = tree_sum(root.left) right = tree_sum(root.right) if root.data != left+right: output = False return root.data + left + right def all_equal(root): global output tree_sum(output) return output

[@lukehatcher98]

Great video

[@filmbotreviews]

High quality video! Thanks

[@insidecode]

You're welcome

[@kirillzlobin7135]

Great channel

[@tanujm87]

Super helpful bro. Thanks a lot ❣️

[@insidecode]

You're welcome!

[@amanr007]

Wow 😎 🥺 thanks brother no more grinding

[@longchikanouo4905]

Finally, this is what I have been looking for; algorithms with proper visualizations. I had to buy all your 5 courses on udemy

[@insidecode]

Thanks a lot for your comment!

[@ifeanyi3713]

hello, is his dynamic programming course in python?

[@insidecode]

Hello, yes it is

[@ifeanyi3713]

@@insidecode thanks for the reply, I will purchase it. are all your other courses on Udemy in python as well ?

[@insidecode]

@@ifeanyi3713 You're welcome! Yes

[@chetanshrivastava3762]

Very Nice.God bless you..

[@shechan456]

Thanku sor finally i understood Tree data after 2 months ,thanks a lot Your content is freat

[@insidecode]

You're welcome!

[@BryceChudomelka]

This is amazing

[@subee128]

Thanks

[@josiahdavid7735]

This man is literally the best!!!

[@insidecode]

Thanks a lot!

[@mayankkhanna9644]

Can we solve every binary tree problem using either BFS or DFS?

[@pranjalmishra2602]

Amazing

[@Radi0he4d1]

This nails it

[@fahmidurarnob2470]

Thanks a lot🖤

[@insidecode]

You're welcome!

[@myrelaxpoint]

A BIG Thank you 🌹

[@insidecode]

You're welcome!

[@coolkid9206]

This actually works holy shit this is insane

[@ojas2121]

best video. perfectly explained.

[@insidecode]

Thanks!

[@gurudevsanthosh8483]

For height of tree it must return -1 if root is null.(2.42)

[@siddharthvikram3054]

that depends if u are taking the height of a leaf node to be 1 or 0, it depends upon the book u are using

[@mahmudulahsan]

Great!

[@khanmuhammad3021]

Wow amazing

[@markfung1]

OMg this is amazing lol thank you so much

[@insidecode]

You're welcome!

[@hildamartin8022]

thank you!

[@insidecode]

You're welcome!

[@minusCEE]

Underated video

[@harsh9558]

Thx a lot!!!!!

[@insidecode]

You're welcome!

[@niketkumardheeryan3865]

Thank u

[@istiyak_8426]

Sukriya Sir

[@lorenzo.fiorini]

Easy and straight forward

[@adithiyagurupatham3255]

You've earned a new subscriber 🔥

[@insidecode]

Thankss!

[@alexirabor]

Thank you

[@insidecode]

Welcome!

[@eshank2508]

Hi..i have to appear a HireVue interview soon for Deloitte. Will this coursepack be useful to me?

[@insidecode]

It contains a lot of popular problems on different patterns and data structures, so it will be useful for you for sure

[@shashicsnitjsr]

How do you create the animation? Are you using any software for tha?

[@insidecode]

With PowerPoint

[@shashicsnitjsr]

@@insidecodeOhhk. Thanks a lot.

[@insidecode]

@@shashicsnitjsr You're welcome!

[@vikasagrawal9945]

execellent

[@AviPars]

Thanks, share code too!!

[@samxsharan]

@2:40 will max( leftHeight , rightHeight ) return --> ' 1 ' ?

[@insidecode]

It depends on where we are in the tree

[@samxsharan]

@@insidecode gives '1' till it meets base condition?

[@insidecode]

No it can give more than 1, try to apply the algorithm on a tree and you'll see

[@samxsharan]

@@insidecode gotcha🙌🏾

[@jacobmoore8734]

Omg it's literally always the same thing, how have I never noticed this before?

[@d3v-x64]

omg thank you, you saved my ass

[@PepeTostado]

How do you learn this for sure?

[@insidecode]

Learn what?

[@iangoodman7273]

isn't the tree that appears at 30 seconds not a valid bst?

[@insidecode]

It's not supposed to be a BST

[@sniff4643]

can I donate to you on patreon? I rly liked this video.

[@insidecode]

Discover the new graph theory algorithms course: inscod.com/graphalgo 🔴 / \ 🔵-🔴 | | 🔴-🔵

[@emiledin2183]

I will leave a dislike because you didn't explain how it actually works in the code. Like at 1:41 what does assigning a variable to the recursive function even do and mean? Please help me understand. Like why assign the variable and not just return root.data + treesum(root.left) + treesum(root.right) instead? Thank you

[@human-011]

awesome x 100

[@santoshreddy9963]

Oooooo maa gooooo, turuuuuu triiick

[@KeshavKumar-qz7ow]

1:20 the sum will be 110 instead of 120

[@insidecode]

You took time to calculate :0 But thanks for telling me!

[@manikantpandey4753]

Can we have pdf of these codes?

[@insidecode]

I didn't make a PDF of them sorry

[@rajathrao3209]

Damn never knew tree's can be broken down like this

[@oladipotimothy6007]

Recursive thinking

[@MrRyanroberson1]

that bri-eff though XD (brief is said as breef, not bri-eff)

[@insidecode]

oh thanks for info!

[@servantofthelord8147]

Wow.

[@rclarke88]

The sum of elements at 1:21 is not 120.

[@rclarke88]

@@insidecode That was a bit nit-picky of me to point that out. The video was still very good and I look forward to watching more from you.

[@insidecode]

Hello, after watching it again, it's actually 120, because we're returning sum of left subtree + sum of right subtree + root's value, and 52 + 53 + 5 gives 120 not 115, you forgot to also add the root's value which is 5

[@cocoarecords]

👍

[@droid806]

Your code in 1:31 doesn’t seem to work

[@insidecode]

What error you got? Maybe you didn't create Tree class or something

[@insidecode]

Fix: At 2:38, the base case should return -1 not 0

[@Raven-zk2xq]

Maybe I misunderstand why, but I think of it like this. If the input is simple None to begin with, is the height 0 or is it 1? From my understanding it would be 0, similar to how an len(arr) where arr is an empty array would also return 0.

[@insidecode]

@@Raven-zk2xq Yes but height 0 is the height of a tree with one node only (the root), so when a tree has no nodes at all, its height is -1

[@prapanchayatrikudu6437]

Excellemt