Bottom view of a Binary Tree Algorithm

[@debs1991]

The honesty you pour while explaining is priceless. Thanks : )

[@vivek5562]

That smile when he said these are over each other..9:32

[@adityaaggarwal4622]

bhai 🤣🤣🤣🤣🤣

[@mkmayankchaudhary90]

Sir....u r officially awesome..... means the ease with which u explain the stuff is superb !! Thanks again

[@wshgziva9952]

Wonderful explanation, can understand very clearly, thanks a lot!!

[@arjungurjar4600]

Great Job , Thanks for uploading.

[@param_083]

Nice explanation .Sir please upload a video on "cloning a binary tree" .
thank you

[@vivekanandkhyade]

yes sure parmanand..!

[@surbhisharma8052]

Awesome explanation sir , keep uploading

[@bmrreddy2002]

Is it more efficient to do this versus using a List? using a regular level order traversal -
Top View : Use a queue in the HashTable, and foreach keyvaluepair ordered by key, u just have to peek the queue.
Bottom View : Use a stack in the HashTable and foreach keyvaluepair ordered by key, u just have to peek the stack.

[@tejaswgaur8813]

same thoughts

[@TheJazzzzzzzzzz]

very good explanation .. impressed

[@rachitdiwan7312]

Great work man, keep going.

[@manikumar5198]

sir can you explain algorithm for solving rat in a maze problem

[@ankitvishnoi8670]

It would be very helpful if you show us the working code in any programming language at the end.

[@karun4663]

check out geeks for geeeks for code

[@BtrmaAbhishekVerma]

Thanks. Very helpful

[@sarikaranjitkumar174]

Thanks for the explanation!

[@premgupta9130]

sir you are fantastic

[@ayushpant6190]

If 'G' node didn't have its left and right nodes and 'D' node didn't have its left and right nodes then our ideal answer should be d, b, e, f, c, g.
But according to our algorithm d, b, f, c, g as our 'e' and 'f' nodes hd value is equal to 0.
Can some one explain?

[@gourharisharma9373]

his implementation has a small bug that it is not vertical order traversal, its horizontal level traversal.

[@anandprakash3536]

sir u r immensely requested to put the videos of hashing using code in c. It shud contain some examples.

[@parthsoni7370]

Nicee!

[@gourharisharma9373]

This implementation has a small bug that it is not vertical order traversal, its horizontal level traversal.

[@tapanjeetroy8266]

Thanks a lot sir

[@clashofclanss463]

Thank u very much sirrr!!!!

[@goyaldeepak702]

Thanks its very helpful

[@vidyasagar8447]

Hi sir, I think doing inorder traversal while printing the nodes which has left and right children as null will also work. if it works then it will be better way right?

[@balakrishnanramachandran8828]

good idea

[@ajeyajois9186]

it wont work all the times wen ur tree has only 3 nodes root,left and right then ur bottom view contains all 3 nodes but ur logic prints only left and right child hence it fails

[@vishaldeshpande6514]

sir ,please upload the code in the discription .thank you

[@mayankgupta2543]

Why do ppl ask for code. Will the mug up?? If yes how useful it is.

[@tsupreetsingh]

Thanks bruh

[@balakrishnanramachandran8828]

u r gr8

[@AddieInGermany]

Sir provide the git link for the code if you'have.

[@kushagradeep1963]

thnx man

[@anamikadolly4684]

Please upload the code.

[@ZiiiP2142]

Cool. ^^

[@Subs1208]

Why d should be part of bottom view ?

[@Ankit13555]

but sir if we also have to print nodes at same horizontal distance ...then do we need to keep track of vertical distance too??
If yes how?????

[@vivekanandkhyade]

we only need horizontal distance......Thanks Ankit.......i will discuss more on this problem if you want.

[@Ankit13555]

Yes sir

[@anty_07]

The solution seems incorrect for below case -
a
/ \
b c
/ \ / \
d e f g
hd -
a = 0
b = -1
c = 1
d = -2
e = 0
f =0
g = 2
By your algo, dbfcg should print, which in correct.

[@hardikagarwal7652]

bhut ghatiya explanation