Construct Binary Tree From Inorder and Postorder traversal (Iterative method) | Trees

preview_player
Показать описание
In this video, I have discussed how to create a binary tree from inorder and postorder traversal. I have discussed iterative method which uses stack.

00:00 Introduction
00:07 Logic
01:16 Pseudo Code
10:31 C++ Implementation

-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------

For other tree tutorials, please refer to the below links:

For in-depth Graph theory and implementation details, please refer to the below playlist:

#DataStructure,#Trees,#FitCoder,#Algorithm,#competitiveprogramming,#binarytree
Рекомендации по теме
Комментарии
Автор

00:00 Introduction
00:07 Logic
01:16 Pseudo Code
10:31 C++ Implementation

FitCoder
Автор

Must say this trees series is coming out great 👌🏻.Highly recommended !!

himanshidhamija
Автор

Effortless understanding with such content. Thank you 🙏

Vasudha_neha
Автор

Thank you so much for all your hard work!

codingninja
Автор

Yep all your explanation are awesome...one suggestion please keep a smile face in your video thumbnail😅😊

priyampratyushsahu
Автор

Thank you so much for providing us such important concept in deep
I have one issue are you covering all type of trees in further videos or just only binary tree?

sanchitmangal