Bottom View of a Binary Tree | GeeksforGeeks

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

Practice Problem Online Judge:

This video is contributed by Anant Patni

Please Like, Comment and Share the Video among your friends.

Install our Android App:

If you wish, translate into local language and help us reach millions of other geeks:

Follow us on Facebook:

And Twitter:

Also, Subscribe if you haven't already! :)
Рекомендации по теме
Комментарии
Автор

Look like some virtual assistant is reading the tutorial with mouth chapping.

bnwboy
Автор

guys u need to learn first vertical order traversal
then u don't even have to watch this video
u will undertand the rest of the views urself.
stop blaming this guy 😂 good explanation bro.

codingexception
Автор

Good explanation. But I feel the final answer should be "4 6 3 5" and not "3 6 5 4". Please correct me if I'm wrong.

abhisheksen
Автор

Great Video GfG!
What is the difference between Map and an unordered set

nands
Автор

can't we just do it with pre-order traversal, where we print a node only when it doesn't have any child (i.e !root->left && !root->right)?

gyk
Автор

Bro.. plz check your voice, where to take pause and where not.. we need to put extra effort to listen to you than understanding the concept.

ujjawaltripathy
Автор

gfg video content is really poor.Non of there videos are satisfactory

adityatiwari
Автор

very bad video
nothing is understood properly

yuktikhantwal