Zig Zag Traversal (LeetCode 103) | Full Solution with visuals and a little trick | Study Algorithms

[@meenakshiwadhwa4625]

Loved the explanation. I like the way you teach. Thanks for great content !!

[@akshayraj_singh]

Congratulations for 10k 🥳

[@floatingfortress721]

Thanks! After watching this video I was able to solve a similar leetcode question, "Binary Tree Right Side View"

[@nikoo28]

that is wonderful

[@susmitapatil4847]

Best Explanation. Keep doing good work.

[@himanshisingh9]

loved the approach. writing how we made queue for level order and then thinking about how we can achieve zig zag pattern with small tweaks. thanks😇

[@nikoo28]

Glad you liked it.

[@LalitSingh-nd5vx]

thanks for awesome explanation !

[@Mydailymutualfundportfolio]

Very good explanation 🎉❤

[@nikoo28]

Thanks for the love!

[@tanishkaagarwal6750]

Thank you for the wonderful explanation sir

[@ghanashrim2839]

The way you approach a new problem is something I'd really like to learn. Amazing explanation as usual. What software do you use for video recording and editing? Is this iPad mirrored on the screen and then screen recorded?

[@nikoo28]

I use final cut pro for all the edits, and on iPad I use GoodNotes 5

[@ghanashrim2839]

@@nikoo28 Thank you :)

[@deepondas5001]

sir i would say you have great approach and explanation skill if you have done a great marketing then you may have thousands of views

[@saurabhruikar1131]

As always very nice explanation, I would like to suggest a tweak instead of using stack we could simply reverse temporayList at alternate iteration.

[@nikoo28]

That's a great idea!

[@xxxlr1]

You are awesome and I love your video explanations! My solution was similar but instead of using a stack, I reversed the created list for each level and added it to the final answer list based on the boolean flag. Is it the same as your solution as far as Time and Space complexity, or is it worse?

[@nikoo28]

as long as the time and space complexity is same, doesn't really matter

[@amitbhattacharya356]

There is a small mistake in the code while adding popped element from stack to level, which is self explanatory: Fixed code: TreeNode node = reverseStack.pop(); level.add(node.val); Appreciate your effort, thanks.

[@nikoo28]

Thanks for clearing it out. :)

[@saifahmad141]

which line??even the one on screen is running correct

[@SibiRanganathL]

Understood

[@avinashtiwari4025]

can you also explain how we compute the space complexity for this ?

[@nikoo28]

space complexity is simply the extra space we use to arrive at our solution. We use a stack, that can have the maximum of n elements in the worst case. Hence, space complexity is O(n)

[@ssss22144]

please start graph problems also anna

[@nikoo28]

Did you have a look at my playlist on graphs?

[@manishasharma-mh7fo]

sir could u pls make a video on boundary order traversal .

[@nikoo28]

can you give me an example link?

[@vibhanshusharma9143]

Bro for instead of stack we can simply reverse a vector Batao m puch rha hu😅

[@mjeevan2408]

hi sir. I seen Ur backtracking video , I commented below that video can u replay for that comment.

[@nikoo28]

How can I help you?

[@navyashreeamam753]

@@nikoo28 I want more default problems with solutions on backtracking algorithm can u Make problems on that ,sir

[@pragyaprashar7165]

Hey Nikhil, I have messaged you on LinkedIn.