Left View and Right View of Binary Tree | Iterative Method | Trees

preview_player
Показать описание
In this video, I have discussed how to find left view and right view of binary tree. This can be done both recursively and iteratively. Here, I have discussed the iterative approach.
Left view of a Binary Tree is set of nodes visible when tree is visited from left side.
Right view of a Binary Tree is set of nodes visible when tree is visited from right side.

00:00 Introduction
00:08 What is Left View and Right View ?
01:30 Left View Pseudo Code
07:47 Right View Pseudo Code
08:37 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:08 What is Left View and Right View ?
01:30 Pseudo Code
08:37 C++ Implementation

FitCoder
Автор

Thanks bro...these videos really helped me a lot before exam.

devlead
Автор

thanks for making such videos, your video really make understanding much easy, it mght have taken days to understand all these iterative and recursive process, but with ur videos its so easy to understand....


thank you very much

barshapal_
Автор

Thanks and Nice explanation, keep up your good work and you are doing it already

karthickak
Автор

Amazing explaination... I had watched all other videos.. but this is the best among them.. just a 0th level explanation for beginners...👍

anjalivedpathak
Автор

Thanks for explaining both the iterative and recursive method in all your up the good work 👍

codingninja
Автор

As always it's so easy to learn with the help of your vedios. Thank you

Vasudha_neha
Автор

Well explained but I am getting syntax error while running on gfg.

snehakumari
Автор

Really awesome videos I wasn't getting how to implement trees and graphs ..I have one doubt ...how come we write "*i" in the visited array in depth and breadth first search of graph ...pls explain .thank you

sugammehta
visit shbcf.ru