Binary Tree Right Side View | DFS | Amazon | Leetcode 199

preview_player
Показать описание
In this video, we will see how to solve the Tree Question "Binary Tree Right Side View" using DFS (Pre Order Traversal)

Problem Name : Binary Tree Right Side View

Company Tags 😱🤯 : Accolite, Amazon, Flipkart, Knowlarity, MakeMyTrip, Ola Cabs, Open Solutions,
OYO ROoms, Paytm, Qualcomm, Samsung, Snapdeal, Twitter

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

Small Correction. It's "VIDEO-2" of Binary Tree Playlist 😇

codestorywithMIK
Автор

i guess it not preorder it just root->right->left,
and that too with the level condition i guess
Am i right ?
anyway the explaination is too good!!

Sagar-trz
Автор

Wow, Amazing explanation Bhai. Thanks a lot

theunusual
Автор

Small Doubt:
why can't we just break or return from recursion when ( result.size() > level ), why iterating the whole tree when we got our answer
OR
returning to the root from where we started is the only way to return from recursion ?

harsh.jain
Автор

Bhaiya where is top view, vertical order traversal question
please add, it will really help us

Servant-
Автор

BHAIYA AAPKO PRE ORDER NAHI POST ORDER RAKHNA CHAIYE THE NAAM USS FUNCTION KAI

prathamsarraf
join shbcf.ru