Tree Traversal Spiral Order

[@xVermyy]

You can just keep track of even and odd levels. If the level is even pop the nodes from the back, add left and right to the front, otherwise pop the nodes from the front, and add left and right to the back. I think it's easier to think of this way, but your ways work too :)

[@gauravkumarjaiswal8224]

Thanks for this video...quite an easy explanation for all 3 approaches....

[@DarshanWashimkar]

Thanks for the video Tushar. I think all 3 solutions are essentially same because the time and space complexity are same for all of them. Of course, it is always good to know the multiple approaches.

[@subhrakabasi9016]

All the 3 programs have nested while loops, so the time complexity should be O(n^2), in your github page it says O(n)

[@kushal1997]

Just because its nested doesnt mean we are traversing same elements multiple times right. Look at how many time we traverse a same element. Its just once so hence O(n)

[@Null_pointer_exceptn]

thanks , deque way is good, didnt know abt it.

[@madhukiranattivilli2321]

Space complexity has to be O(2^h). How is it O(n)? (h: tree height) I mean... the max number of items in stack or queue, is from the final tree level. If it is a perfect binary tree, and if tree height is h, final level wud have 2^h nodes. We can also say this as N/2 nodes. O(N/2) is treated as O(N) -- may be Tushar is taking this way But O(2^h) feels more accurate -- as we want to use Big-O to represent worst case situation. Please comment

[@muhaiminislam5931]

Great videos man. For the growth of your channel I would suggest look into sound quality and lighting

[@bchilakala]

Awesome explanations. Thanks for the videos. If you have time please do more dynamic programming videos.

[@kalpanameena9854]

Add code explination for rest two methods also, it will be very helpful.

[@ameyacm]

Thanks Tushar! Very helpful.

[@SHRIWALANKIT1234]

Awesome Explanation

[@mahadevpujari2268]

if time permits upload more videos on data structure,well explained.

[@ayushiajit5773]

Thank you ...ur videos help me a lot :)

[@sarthakrohilla8124]

There will be no peace in this world until hatred exists.

[@shikharchaudhary6984]

interesting techniques.

[@shivaniamehta9851]

Sir, how should this be implemented using recursion?

[@vivekgr3001]

Perfect!

[@saumyaaggarwal3359]

wonderful!!!

[@100_bindusai8]

:-) Thank U😀

[@srinivaspochincharla4098]

Hello, I implemented the two stack technique logic for the question on leetcode. It throwing time limit exceeded.

[@ChandraShekhar-by3cd]

What will be Time and Space Complexity of this Approach using Two STACK. Could someone pls explain? Thanks

[@nishchaytomar9844]

O(n) because we are visiting and operating every node only once.

[@vigneshwaranr680]

I have one doubt. In the second approach( 1 deque) you have pushed NULL as a limiter first. NULL in an integer deque is equal to 0. So if tree has a node with data part 0, will also act as a limiter. How to overcome this ?

[@anupreetsihra9229]

null is not an integer

[@pranayreddy6337]

Well why would you create an integer deque? How can you access other elements with i.e children with integer values in deque?

[@talalnabulsi7071]

Would this also work with two queues instead of two stacks?

[@lukitaz]

nope

[@kartikprajapati5569]

Terrible handwriting... haha