Wrong Answer for 1 test case

#1

I’ ve got the mistake but how to correct it?
Input:
20 8 22 5 3 4 25 -1 -1 10 14 -1 -1 -1 -1 -1 -1 -1 -1
Expected Output:
5 10 4 14 25
My code’s output:
5 10 4 22 25

how to correct it?

#2

The approach is incorrect. 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 seen for the first time, we update the value and the level for current horizontal distance in the map. For each node, we recurse for its left subtree by decreasing horizontal distance and increasing level by 1 and recurse for right subtree by increasing both level and horizontal distance by 1.
You are simply considering that if this node was discovered later for the same distance then it must be visible which is not true always, like in this case.

Here is your corrected code https://ide.codingblocks.com/s/285670

#3

thank you that was much clear