One test case is not pass

#1

here is my code:-

All test cases are pass except one. Can you tell the corner case I am not getting.

#2

It should be correct but I don’t know why one test case failed.

#3

@Jitinkansal
Your approach is not completely correct
your are not considering the all test case
look at second example tree discuss below
this is the case in which you get wrong ans

i have discussed the detail solution of the problem read this
this will be helpful to understand your mistake

Given a Binary Tree, we need to print the bottom view from left to right. A node x is there in output if x is the bottommost node at its horizontal distance.

Horizontal distance of left child of a node x is equal to horizontal distance of x minus 1, and that of right child is horizontal distance of x plus 1.

Examples:

                  20
                /    \
              8       22
            /   \      \
          5      3      25
                / \      
              10    14

For the above tree the output should be 5, 10, 3, 14, 25.

If there are multiple bottom-most nodes for a horizontal distance from root, then print the later one in level traversal. For example, in the below diagram, 3 and 4 are both the bottom-most nodes at horizontal distance 0, we need to print 4.

                  20
                /    \
              8       22
            /   \    /   \
          5      3 4     25
                / \      
              10    14

For the above tree the output should be 5, 10, 4, 14, 25.
You are getting 5 10 4 22 25

Approach

The following are steps to print Bottom View of Binary Tree.

  1. We put tree nodes in a queue for the level order traversal.
  2. Start with the horizontal distance(hd) 0 of the root node, keep on adding left child to queue along with the horizontal distance as hd-1 and right child as hd+1.
  3. Also, use a TreeMap which stores key value pair sorted on key.
  4. Every time, we encounter a new horizontal distance or an existing horizontal distance put the node data for the horizontal distance as key. For the first time it will add to the map, next time it will replace the value. This will make sure that the bottom most element for that horizontal distance is present in the map and if you see the tree from beneath that you will see that element.

you can take help from reference Code

Reference Code

if you have more doubts regarding this feel free to ask
i hope this helps
if yes hit a like and don’t forgot to mark doubt as resolved :grinning: