Find Minimum Distance Between Two Nodes In A Binary Tree

[@hariprakash1715]

I was totally confused at first because you didnt metion that minDis is globally declared or passed by address, But at the end i could understand now. Thanks

[@prateekshrivastava2802]

The best approach one could get for this question and also explained amazingly well !!

[@CppNuts]

Glad you think so!

[@runggp]

great video! I think the recursive algo also has cost of implicit memory call stack for all the functions in the chain, which is O(n). For large trees, it is said that is more than O(n) and iterative algo is preferred. Is there any better space efficient algo?

[@trendupdiscovery7091]

I am recently view c++ video it was amazing 😍 thanks you sir .. please bring complete one shot video of DSA ...in c++ and thanks for video .. amazing content .😍😍

[@CppNuts]

Thanks..

[@karthikmetlapalli5975]

This is a good video with great explanation with respect to flow and different cases. But it would be great if you could explain your thought process/ steps in converting the algo to code.( Basically steps about how you wrote that code rather than how it works) thanks

[@CppNuts]

That would be nice.. i would try to go for thought process first.. Thanks for the valuable comment..

[@AbdulRauf-rx3sf]

Excellent