How to solve binary tree path-related problems - Inside code

[@manulscode]

In 5 minutes there's more value in this video than in hours of other tutorials!

[@tmanley1985]

This has to be the simplest explanation on youtube. The idea of taking an idea like DFS or BFS, and showing example after example of it being used with increasing complexity is the best way to learn. I bought your course on Udemy just to support you.

[@insidecode]

Wow, thanks a lot!

[@kalpeshsharma3446]

Brother you are a saviour...please do more videos like this only on all data structures, and common algorithms which can solve many questions.

[@bitasadeghi5312]

Your amazing tutorials helped me immensely, please keep them coming. Thank you!!!

[@insidecode]

You're welcome!

[@akshay5469]

Can you make a video for tree problems where path doesn't necessarily pass through root? I struggle here thanks!

[@insidecode]

Give me an example!

[@namratabhongale7435]

@@insidecode Longest path in a tree.

[@somyagupta5491]

Great explanation, one stop point for conceptual understanding of various path related problems

[@somyagupta5491]

Could you please make a video on construction of trees using various given traversals like preorder,postorder etc? That would be really helpful

[@insidecode]

It would be interesting yes

[@PriyadarshiPrashant]

i am glad that found your channel

[@sainathsingineedi2922]

Nice explanation. Animations are 🔥

[@ISABELLEDUPONTTT]

for the Lca function basically in exam we can't use break; so what can i replace it with? if the path doesnt match?

[@HOMMIAABIR]

u can for example add a boolean, initialize it to true and add it as a condition in the while loop, if we reach the else condition(path1[i]path2[j])u can set it to false to exit the loop, hope i helped!

[@oussamabaadj9355]

THE BEST ! "after me"

[@naveenkumarnalabothu9926]

The code used for getting path array is returning empty array.., can you please check again

[@nit_gaal]

I am ur new subscriber 🤗

[@subee128]

thanks

[@pdfToMp3]

Ur a hero

[@anubhavsethi3416]

good content btw !

[@AinurEru]

For lca there's no need to make 2 paths, here's a simple dfs that does it: def lca(root, val1, val2): if root in (val1, val2): return root left = root.left.lca(val1, val2) if root.left else None right = root.right.lca(val1, val2) if root.right else None return root if left and right else (left or right)

[@akshay5469]

Great

[@motasemmeqbel6742]

Amazing

[@mobeenegbaria1617]

I am wondering and trying to figure out What is the answer to the exercise 3:24 with just using dfs func with an additional parameter val2

[@insidecode]

Any node in a binary tree is a root of a smaller tree, so we can just combine the search() and the get_path() function, we search for the source node, then we call get path on it once we find it

[@codeduel]

All you just need to do is to search for the source node and make it the root of the tree.

[@oussamabaadj9355]

L engineeeeer yah !