Inorder traversal without recursion | Iterative Inorder tree traversal

[@CDJohnson]

This is the best and most simple implementation I have seen! Thank you!!

[@MilindGupta]

Please tell what's the intuition for using stack here

[@anonymous4030]

@@MilindGupta because stack follows LIFO order

[@MilindGupta]

@@anonymous4030 bro u r replying after 8 months huh I know all this now

[@anonymous4030]

@@MilindGupta 😂😂

[@maxalbrecht9913]

Javascript implementation I wrote, in case anyone is interested: function inOrderTraversal(rootNode) { let stack = new Stack() let currentNode = rootNode // INITIALIZE THE STACK while(currentNode != null) { stack.push(currentNode) currentNode = currentNode.left } // ITERATE let poppedNode = null while(!stack.isEmpty()) { poppedNode = stack.pop() console.log(poppedNode.value) currentNode = poppedNode.right while(currentNode != null) { stack.push(currentNode) currentNode = currentNode.left } } }

[@techdose4u]

Thanks for sharing.

[@marjanfarsi6388]

Thanks! Would you please analyze its time and space complexity?

[@gourav.barkle]

Very well explained, Good work keep posting.

[@techdose4u]

Thanks :)

[@MilindGupta]

Please tell what's the intuition for using stack here

[@TheNealtt]

@@MilindGupta Recursion internally is stack. So normally inorder is done using recursion and if we have to do it iteratively, stack must be used.

[@twilite295]

Appreciate it, great explanation

[@techdose4u]

Thanks :)

[@luobohu8128]

thank you sir. best explanation

[@techdose4u]

Thanks

[@sakshisingh9706]

you are doing really well .keep it up:)

[@dipanmondal8270]

❤️❤️hlww

[@gourav.barkle]

​@@dipanmondal8270 Men will be Men

[@aryakv5993]

Thank you sir...🙂😀

[@techdose4u]

Welcome :)

[@Samtoosoon]

extreme left full traverse such that stack emty and curr==null

[@sagrika7096]

Thanks👍

[@techdose4u]

Welcome 😊

[@HimanshuKumar-xz5tk]

Thanks so much, it was helpful

[@techdose4u]

Welcome :)

[@can-tz6po]

Could you solve pls "sum of depths of each nodes in the tree"?

[@dineshbachhav9723]

I think step 3 may start with... If current node is not null then proceed to push current node to Stack..... correct me if wrong?

[@bittuashliya6691]

Helpful

[@crackthecode1372]

Thankyou sir

[@techdose4u]

Welcome

[@rarnald1089]

I have one doubt .... Does the stack stores the address of the nodes.

[@anshumaan1024]

yes

[@MilindGupta]

Please tell what's the intuition for using stack here

[@lastminuteprogrammer8511]

there is no intution. These standard algos were created / invented by top computer scientists, PhD's and researchers like Donald Knuth etc. A normal student cannot have these intutions by himself unless he has done years of study on algorithms, maths etc.

[@adarshmishra8198]

Also, mostly recursion problem you can solve using stack .

[@VatsalRajyaguru17143]

I think your bst is wrong. Why is 2 to the left of 1 when it is bigger than 1??

[@anupamdungdung9417]

This is not a bst this is a normaly binary tree

[@ritwik121]

what is the space complexity of this approach ?

[@AkashGupta-0708]

Sir your code is not visible in the link it is showing error on opening it

[@mysticalgoogler]

what is the board you are using?

[@BhuvanaShreeHJ]

Stack should be empty!

[@964_akshitaghosh3]

i need this code in c

[@pragyamaurya7942]

hello...done condition means the stack is empty ...you are writing here stack is not empty ....how........mtlb kuchh bhi ?

[@techdose4u]

I have flagged that in correction text. Please look at it. It's written in bold and white color.