Binary Tree Right Side View (LeetCode 199) | Both Views with the thought process

preview_player
Показать описание


Chapters:
00:00 - Intro
00:40 - Problem Statement
02:19 - A common mistake
02:58 - Typical test case
03:55 - Different ways to traverse
05:34 - Level Order Traversal Wins
07:06 - Dry run of Code
10:12 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview
Рекомендации по теме
Комментарии
Автор

Love the way you explain, Sir. Keep creating.

avishkarsuryawanshi
Автор

You are one of the underated person brother
Thank you so much for your time and whatever you are doing free for the students like me ❤🎉

vish--vishnu-
Автор

THANK YOU BROTHER .. PLEASE KEEP UPLOADING ON TREE AND GRAPH QUESTIONS NOW AS BY FOLLOWING YOU, I HAVE COMPLETED THE LINEAR DATA STRUCTURE .

ashishsoni
Автор

Your content always helps, Thank you !!

poojajadhav
Автор

Loved the way you teach things really couldn't find much videos on youtube where i can correlate with my thinking process!!🌟

ZenyxPlays
Автор

actually it is eazier in dfs + less code just ask the lvl in the dfs if it match the size of your vector and go right then left dfs(Node, lvl) if (lvl == arr.size()) arr.add() dfs(right, lv+1) dfs(left, lvl+1)

alfykerolous
visit shbcf.ru