Longest ZigZag Path in a Binary Tree - LeetCode 1372 - Python Solution

[@codewithcarter]

How is your LeetCode grind going? Comment below a Leetcode question you need help with!! 🤠

[@nikakondra5321]

Thank you! It was easy to understand after watching your vid!

[@souviksen5177]

which tool youre using for drawing on screen ?

[@ashishshethia6549]

very good solution

[@codewithcarter]

Thank you! I'm glad it helped!

[@sriracha9729]

simple and clean, thanks

[@mahletlulseged4858]

Great explanation ! thanks

[@HeihachiChaolan]

What if you need to go right three times? I don't understand how going right twice takes care of every situation where the new node needs to be the start of "depth" again.

[@kushagarsharma4783]

You are recursively doing it you go right-> else part-> going left with incremented depth , going right with reset depth , same thing repeating for right again

[@rayenchtioui8188]

thank you for the explanation!

[@codewithcarter]

So happy you found it helpful!! Best of luck with your LeetCode grind! 🙏

[@vladhilko]

Thank you!

[@codewithcarter]

You're welcome!

[@aaditya_87]

you don’t even need to include current depth in the max function (line 10,17)

[@BaoNguyen-d8u]

thank you kind sir

[@sohammukherjee1392]

Nothing but THANKS

[@codewithcarter]

You are very welcome! :D

[@daminirijhwani5792]

lets go vimmer!

[@codewithcarter]

Haha love this comment 🤣

[@adityadeep619]

Great explanation ! thanks