Tree bottom view

[anujsharmabadboy (anuj sharma)]

did not get the question

and did not get this line
Note that 5 and 6 are at the same position so we consider the right one to lower

[mr.encoder (Encoder .)]

declare each node with a x-y co-ordinate where x-plane is horizontal and y is vertical. When you will map all nodes, you will see co-ordinates of 5 and 6 are same. Out of these two, we will take that co-ordinate which is at the right side of the tree.

[anujsharmabadboy (anuj sharma)]

sorry, i am not getting the question !!!
how can we map(as not cordinate here)

[mr.encoder (Encoder .)]

Check this

Tree bottom view

hello @anmolsr755 This problem can be easily solved with the help of Hashing. The idea is to create an empty map where each key represents the relative horizontal distance of the node from the root node and value in the map maintains a pair containing node’s value and its level number. Then we do a pre-order traversal of the tree and if current level of a node is more than or equal to maximum level seen so far for the same horizontal distance as current node’s or current horizontal distance is …

[anujsharmabadboy (anuj sharma)]

map is in upcoming lectures. So can it be solved without map ??

[mr.encoder (Encoder .)]

You can first learn map, then try to solve it.

[anujsharmabadboy (anuj sharma)]

ok thank u …

[mr.encoder (Encoder .)]

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.