Iterative Inorder Traversal (Non-recursive)

[@karthikmucheli7930]

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.

[@melihaslan9509]

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

[@ronylpatil]

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

[@dinosaurx6851]

The best explain i have seen. Thanks sir

[@boyapatinagendra2089]

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

[@meleearcher7684]

I agree and after print it needs to be popped

[@gabrielpaschoal938]

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

[@ming820123]

thank you for recording these videos

[@KrishnaPandeyURL]

Awesome Vivekanand...

[@haseen5]

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

[@shrabanakumar7754]

Sir your videos are really awesome

[@ganeshjaggineni4097]

NICE SUPER EXCELLENT MOTIVATED

[@amitagarwal9572]

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.

[@gopaldas7905]

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

[@ShubhamKumar-uf7yk]

Thank you so much

[@fardilviews]

hard-working video ,,,, thanks a lot

[@ahmedouyahya]

you are awesome.

[@praveenchouhan6388]

awesome video, thanks a lot!!!

[@gaganalokesh1946]

Take a bow💓🙏

[@pratapsingh-le2br]

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

[@cherifachi4655]

Thank you sir , for this clear explanation

[@DiasDenny]

Thanks I liked your video

[@knightganesh]

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

[@Antriksh1000]

I think he is doing that

[@vinayak186f3]

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

[@alperklc7782]

thank you for help :)

[@vinit__rai]

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

[@huyenminh2631]

from VietNam thanks u

[@SOURABHGOLCHHABCE]

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 ???

[@alperklc7782]

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

[@dj10schannel]

👍

[@lalitkumarmehta6026]

thanks

[@kkhopade007]

Sir, Could you please share your code on github.

[@vivekanandkhyade]

Sure Denis ....

[@shivanshusingh8328]

It's while not bhile

[@manishgurawalia7625]

Acha ji, angrez ki aulad

[@MustafaKHAN-sw1xb]

krpiya karke hindi mai bhi samjhaei