Iterative Inorder Traversal (Non-recursive) 

Videos like these makes me just want to stop my adblock just so that the creator of the video make money. Thank you for the video.

this problem cannot be explained better than this!! excellent solution.. especially for beginners... wow

U have explained each and every steps in very very efficient way even a 6th std. student can also understand this.

Ajudou um brasileiro, obrigado. Helped a Brazilian, thank you.

The best explain i have seen. Thanks sir

segmentation fault is due to pop(). pop() returns void so getting segmentation fault. So take top element from stack and assign it to p and print the value rest continue

NICE SUPER EXCELLENT MOTIVATED

Very nice explanation, I wrote the code it worked perfectly thanks 👍

thank you for recording these videos

you are the best teacher ....sir please upload video on graph coloring problem algorithm....

Sir your videos are really awesome

Awesome Vivekanand...

Thanks for sharing the videos, I found Inorder and preorder iterative traversal videos but not Post order traversal, could you please upload post order iterative video as well.

Love u Sir No word speechless ur all data structure session but is it possible after explaining the concept to run all the code on ur laptop then very helpful to the every one who is watched ur channel ? Interview Prospective

you are awesome.

Thank you so much

Take a bow💓🙏

hard-working video ,,,, thanks a lot

from VietNam thanks u

Hi Kindly organize your videos into appropriate playlists, it would be easy for us to find them and go through the similar topics in the playlist and complete the learning in a more organized way ... Many thanks you rock

Explanation is great , but would have been more useful had the intuition been discussed

awesome video, thanks a lot!!!

Thanks I liked your video

Thank you sir , for this clear explanation

thank you for help :)

sir very good videos your videos are really awesome sir but you are saying that you upload videos everyday but it is not so sir try to upload the video everyday as it will be benificial for both of us thank u sir ???

def travers(self): stack = [] current = self.root while True: while current: stack.append(current) current = current.left if stack: current = stack.pop(0) print(current) current = current.right print(stack) if stack is None: break First of all, thanks for the lessons. Unfortunately, the cycle does not end. Debug 'if stack is None: break ' code is bypasses. Although the stack is empty, it does not end the cycle. I wonder why. Thank you . respects

thanks

👍

Nice sir, but may I get video on java??

Sir, Could you please share your code on github.

It's while not bhile

krpiya karke hindi mai bhi samjhaei