6.d) Bottom View of Binary Tree [Using level order traversal and hashing]

preview_player
Показать описание
In this video, I have discussed about bottom view of a binary tree data structure. Bottom view is the first element which occurs when we see the tree from bottom side This is solved by using level order traversal and hashing.

I have already made videos on Left View, Right View, top view of binary tree you can also go through that.

Practice question:

I hope you liked my video, do subscribe my channel to get the updates of my latest videos.

#bottomview #binarytree #datastructure #algorithm #levelorder #hashing
Рекомендации по теме
Комментарии
Автор

just wonderful i was thinking how to approach it first never knew this was this simple really great content

LtMewS
Автор

You are teaching in very step wise manner👍. Very big thanks for your efforts ❣️😄

jaskiratsinghosahan
Автор

as the playlist goes number of views decreases that's why people never able to learn DSA. by the way salute to you bhai.❤

ashishranjanpatel
Автор

just amazing concept...thank u so much

amitkumargupta
Автор

Liked your energy of teaching, keep it up bro

abhishekrajpermani
Автор

Marker bhi ni use Karna, siraf Duster use Karna... 😂

sankalparora
Автор

Can you please tell Time Complexity and Space complexity.

PradeepKumar-uect
Автор

turns out bottom view is easier than top view provided we know top view .

devprakash