Inorder Tree Traversal without Recursion | GeeksforGeeks

[@shivankchopra7429]

Amazing teacher with clarity and zero non sense! I regret not having found your channel before!

[@oneworldofstem7724]

Amazing teacher!! Btw, I wonder how do you come up with these 5 steps in 2:39? I think the thinking process is what I REALLY need to learn. Thanks in advance.

[@madagalaharivardhan9412]

EXCELLENT and NICE ATTRACTIVE WAY OF TEACHING

[@wongisa368]

very good video and it did solve my problem, thanks!

[@krishankantray]

Excellent explanation......and nice voice......Thumbs up.....keep it up....

[@GeeksforGeeksVideos]

Thanks, Krishankant! :)

[@JamesBrodski]

Thank you so much for this amazing video.

[@saisrikar7987]

excellent explanation ..Thanks

[@nibedita__dey]

Thank u sir it's very helpful !

[@huda9126]

Can you help me please to found answer for this qustion ☺️ Write a C++ program to iteratively (not recursively) insert an element in a binary tree. Required operations: a. Insert number of elements in a binary tree. Before inserting each element, make sure that it is not exist in the tree. b. Display an error message if we try to insert an element that is already exist in the tree. c. Print the inorder traversal of the tree.

[@david-tracy]

Thank you. Is this faster than recursive approach?

[@michaelqu6732]

No. Traversal has to go through every node so both of them are bounded by O(n)

[@ven7782]

Thanks for the amazing video.

[@poorvisaxena7055]

I want to know if this playlist on trees is enough for coding interviews; along with practise of questions, of course.

[@kautukraj]

Very helpful!

[@jethalalnhk2409]

Very good

[@khaledsabri6429]

amazing, thank you so much.

[@arianphilips5777]

excellent

[@rubencristobalgarcia185]

Great videoo thanksss

[@GeeksforGeeksVideos]

We're glad that you liked it. :)

[@mddar95]

Thanks alot man !

[@GeeksforGeeksVideos]

Thanks Mohamed Darwiche :)

[@jamest7700]

what is the space complexity?

[@ruchakhartadkar773]

helpful! thankyou!

[@satyeshtripathi8533]

is the worst-case space complexity of this approach O(d) where d is the depth of the tree?

[@randomusername818]

yes

[@matanyaasis2]

memory is O(h) right?

[@jayshah8271]

when you will upload next video to related all question on tree?

[@GeeksforGeeksVideos]

Hi Jay, We are working on it. And, you should see more video tutorials on Tree topics in the coming weeks.

[@VenkateshNair]

thnks man

[@GeeksforGeeksVideos]

You're welcome, Venkatesh!

[@malharjajoo7393]

Much easier logic - Just loop over stack until it is empty. // Example program #include #include #include using namespace std; class BinaryTree { public: BinaryTree(int val, BinaryTree* left,BinaryTree* right):val(val),left(left),right(right){} int val; BinaryTree* left; BinaryTree* right; }; void pushToStack(stack& s1, BinaryTree* root) { while(root != NULL ) { s1.push(root); root = root->left; } } void stackTraversal(stack s1,BinaryTree* root) { BinaryTree* current = root ; pushToStack(s1,root); while(!s1.empty()) { cout

[@moazelsawaf2000]

Thanks

[@bindujesin5511]

Good😍

[@soumengorain2891]

Tomorrow's ma xams😂😂

[@GeeksforGeeksVideos]

All the best!! :)

[@soumengorain2891]

The xam ws grt.. thanks to Ur videos😘😘.. never njoyed reading books

[@pg7703]

any body please share the c++ code.

[@tienanzhang6317]

www.geeksforgeeks.org/inorder-tree-traversal-without-recursion/