Iterative Inorder Traversal of Binary Tree

[@euisungkim8028]

Really enjoy your visualizations of algorithms which facilitate learning. Thanks.

[@andypaladino3711]

Thank you so much for making the concepts so easy to grasp!

[@TheZwirek]

Why most people "explain" the algorithm by going step by step on some example, instead of actually explaining it by explaining the whys and the hows?

[@creumakuzola4227]

I'm making myself the same question. This way we don't understand the algorithm, but the example.

[@xenobob2773]

What whys and hows are there for this code? Its a stack, and its in-order. Its use is printing out a Binary Search Tree in ascending order (as far as I can tell). Thats about it.

[@shresthmishra9329]

Criticising others for self incapability is the first step towards self destruction.

[@sohamjoshi9527]

Spot on... I was wondering the same :) people who need to be given one step after other will learn well from this like @Xeno Bob and @Shresth Mishra...

[@FINSuojeluskunta]

The only thing you need to understand is how an inorder traversal works. You're just doing it with a stack instead of a call stack and recursion.

[@drishyakandpal1850]

Finally understood the concept! Thank you so much Sir!

[@studyaccount794]

This channel is gold. The videos are simple yet amazing.

[@נדבסלמן-ט2מ]

Thank you very much, this algorithm has helped me to solve the problem: " write function that receives a binary search tree and returns a list sorted in ascending order containing all the item int the tree(integer , the list and the tree).thank: public static Node TreeToTHEnode(BinNode t) { Stack s = new Stack(); Node L = new Node(-1); Node lastNode = L; while (true) { if (t != null) { s.Push(t); t = t.GetLeft(); } else { if (s.IsEmpty()) { break; } t = s.Pop(); lastNode.SetNext(new Node(t.GetValue())); lastNode = lastNode.GetNext(); t = t.GetRight(); } } L = L.GetNext(); return L; }

[@pruthvigowda7950]

Yes, that's true. You can do in order traversal for BST (not binary tree) to get the elements in sorted (ascending order). The converse is also true, you can do in-order traversal and check if the elements are sorted (ascending order) in order to determine if the given binary tree is a BST.

[@juhabach6371]

most clear explanation on KZbin.. thanks for such an amazing content

[@anujdwivedi5299]

thanks for the explanation of traversing tree unsing sthack

[@kumarc4853]

this video doesnt explain the intuition behind the algo but only explains the steps of the algorithm

[@lizdenhup]

I finally understand thanks to this video!! Thank you!

[@kumarakash5219]

It is wrong code in case of right skewed tree it will not work

[@TriforceTech_385]

Simple and clear explanation. Thank you

[@mukulupadhyay4656]

very well explained...

[@poojask6166]

Very well explained. Thank you

[@HarshaVardhan-jf9sd]

Hi tushar...is there no other way to do an inorder traversal iteratively without using a stack and morris algorithm?

[@ethanhuang2127]

how to check one node is visited or not? Using hashset? but that may only work for no duplicates case, right?

[@abhigyanshrivastava1255]

"my name is -char"

[@allenllewellynkra]

lol u wrong for that

[@Laoguang09]

This is easy to understand, NICE VIDEO!!!

[@samisaacvicliph]

Excellent explanation. Just a small doubt. Is -1 suppose to be the left child of 2? I'm not sure about 11 as well.

[@vinaypatel1106]

It's for General Binary Tree..not for specific Binary Search Tree..

[@starfire_xi]

Very very helpful! Thank you so much

[@JasmeetSingh-oh8fq]

my brain start glitching after seeing this video..

[@zineddinelouzani7069]

this guy is a machine

[@josephstrauss9653]

It's pretty clear! Thanks a lot

[@llliuyu]

Very clear explanation, thanks!

[@rohithbharathi3664]

thank you

[@thisisthebestid]

Can you answer this in interview without knowing the answer beforehand?

[@xenobob2773]

Kinda... its just a stack. And you implicitly use a stack in the recursive version. For 90% of questions though, no.

[@vinayak186f3]

You actually don't need to , just inform them of your approach ,if they feel like you can get to the solution , they'll guide you if you get stuck

[@sumeetsood232]

What is you tube link to see similar questions? he shared it in end of video but i am not able to understand it

[@avisha92]

Generally speaking, while(true) is a bad practice (in case you accidentally leave no exit routes) and I can imagine the interview calling that out.

[@holyshit922]

Conversion binary tree to doubly linked list is similar to the traversal (inorder is good when we have binary search tree and want sorted doubly linked list ) but instead of printing key value of nodes we append it into doubly linked list Can we convert binary tree to doubly linked list without recursion and without creating new nodes in time O(n) ?

[@ankurshah3112]

Yes def treeToDoublyList(self, root: 'Optional[Node]') -> 'Optional[Node]': if not root: return None stack = [] temp = root head = Node(0, None, None) last = head final = root while True: if temp: stack.append(temp) temp = temp.left else: if not stack: break temp = stack.pop() final = temp last.right = temp temp.left = last last = temp temp = temp.right first = head.right final.right = first first.left = final return head.right

[@kuro7249]

Thank you so much, this video is really helpful.

[@codemarshal655]

Did you know, you can do iterative in / pre / post order traversals using same code?? Checkout how I did it in just 20 lines, in my new video kzbin.info/www/bejne/bKjbf5ZunKidbqc

[@gabriellerosa6453]

love your videos , im from brazil thx

[@deathbombs]

recursive so easy and iterative so tough

[@yangwang24]

Thanks a lot.

[@CrazySkillz15]

Thanks. Your video made it so easy to understand. Much Appreciated :) :D

[@nocturn2002]

awesome video

[@supremoluminary]

How did you figure this out?

[@haiphan9181]

bruh what you smoked send me some

[@snlagr]

why? i dont get the joke

[@anjushajoshi8497]

I am getting an error when I do this :stacks=new stacksp;

[@dhruvyadav1159]

Always try to avoid dynamic allocation of STL

[@rishabhjain2404]

Thank you!

[@junjiezhang4523]

great!

[@cagrsahin4132]

how is -1 bigger than 11?

[@sadhlife]

this is not a binary search tree, it's not sorted data, it's just a random binary tree

[@arthur6892]

Thank you so much for sharing this. It's so clear and helps me a lot!

[@hemsagarpatel8992]

nice

[@sumodmadhavan]

I don't think it is a valid BST because it is not sorted. I hope idea is to only explain Inorder using stack.

[@nishantkaushik7161]

no where it is written that its a "binary search tree".... just a binary tree..

[@vishfulthinker]

Isn't the time complexity Big O of n and and not 'h'?

[@xGXLx]

I know this is from two years ago, but h can equal n in it's worst case

[@SomnathMukherjee1112]

please make a video on Inorder Tree Traversal without recursion and without stack! Morris Traversal!

[@jbejyz]

I think you make some thing wrong in the Binary search tree. The left children of root 10 should less than it and right children should greater than their root

[@TheAmonkeys]

+Buer Jiang This was a traversal of a binary tree not a BST.

[@algorithmimplementer415]

Nice explanation :)

[@kunalmahajan7142]

Tushar your videos are lovely. Can you please start making videos on codechef challenges if possible.... It would be really beneficial for us in understanding complex questions. ThankYou! :)

[@deathbombs]

umm you just jump into algorithm explaining how it works... but no explanation of how to arrive at it?

[@kumarakash5219]

This code will not work in case of right-skewed tree

[@kritisingh3194]

It works fine in case of right-skewed tree. Suppose, root = 15 root->right = 25 root->right->right = 35 root=15 root!=NULL, we will push 15 to stack. root=root->left = NULL So, now as root==NULL, we go to else condition and print 15 Now, root = root->right = 25 And then, you continue following the same process.

[@kumarakash5219]

@@kritisingh3194 yes ty for explanation

[@vinayak186f3]

REVISION NO 3 😶

[@shikharjain6357]

Toosharp!!

[@adeled8833]

i need subtitles

[@juanflores2226]

In python please 🙂

[@anoopnayak8106]

Iterative sika na bp😡

[@reviewterrain9835]

whats "sthack" lol

[@konarkverma9102]

have you smoked weed?

[@adityadarekar3963]

why u r trying an American akcent

[@Boarky]

Why ask? He's really easy to understand, is he not for you?

[@adityadarekar3963]

Boarky Chup be lvde

[@simrandotdev]

He has been living in US from last 9 years. So you tend to start speaking certain words how American speaks so they can understand.

[@VidyaranyaJayaPrakash]

why don't you start off by learning spellings lvde

[@mightbeLara]

Aditya Darekar Why shouldn’t he ?

[@Kushagra_21]

why do you teach as if we are here to mugg up everything.

[@dermot864]

thank you

[@alvxlopez]

thank you