Preorder Traversal | HackerRank | Tree | Recursion | Python

[@utkarshx27]

bhai god ho kya sb smjha diya simply

[@codingcart]

Glad it helped 😊
Please do share with your friends too 😊

[@sahilbisht3661]

Awesome explanation 🤟

[@codingcart]

Glad you liked it

[@guilhermenunes9776]

Awesome, now I understand better how to code pre order traversal, thank you!

[@codingcart]

Glad to hear :)

[@sumitlakhera766]

Thank you very much !
But why are you saying (left, root and right) again and again like at 05:24 . It should be (root, left and right) , correct ?

[@tusharbansalm6710]

Hi, I have a doubt with the question in hackerRank. In the function for pre-order they directly have root in parameter and the self keyword for object is missing. Can you please explain how it works?

[@paruluniyal2305]

So nicely explained 😊 ☺️

[@codingcart]

Thanks a lot 😊

[@swarupsarangi734]

Thank you for the explanation ❤️

[@codingcart]

Keep learning 👍

[@jedi10101]

if root is not None:
why not use?
if root:

[@shahsikalagowda183]

Understood🤍

[@codingcart]

Glad it helped😊. Please do share with your friends too😊

[@sruthigudimella1162]

Show the full code please

[@codingcart]

Full code for preorder??