Binary Tree - 45: Print Root To Leaf Every Path In Binary Tree

[@sivaganesh4489]

Most underrated channel

[@CodingSimplified]

Thanks. Please share the channel content with your friends.

[@sivaganesh4489]

@@CodingSimplified defently already suggested your binary tree playlist to many of my friends please do more videos

[@CodingSimplified]

@@sivaganesh4489 Thanks.

[@jabedakhtar5156]

wish I could know this channel before ❤️ lovely explanation brother ❤️

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@selvalooks]

cool , i had the solution of removing the leaf node from the array after printing, but your solution is better its not updating the index++ instead index+1, nice !!!

[@CodingSimplified]

Thanks for nice feedback. Keep Watching.

[@sojanmathew5875]

How about using stack instead of array? (no need to manage index). If ( node is leaf) { print stack; pop node; return}

[@ShreyaSingh-vr9qi]

How we can solve this problem using iteration ??

[@CodingSimplified]

Here we're solving via preorder. You can take a cue from following video, where we're executing preorder without recursion. : th-cam.com/video/qv1nLlk5LEU/w-d-xo.html

[@tastaslim]

Easily using Iterative preorder and a map to have a check of nodes visited or not.

[@upendrachauhan5260]

do not waste your time by watching this video

[@soumavanag5025]

thank you very much :)

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.