1 test not working

[Manvik-Arya-4391661007540658 (Manvik Arya)]

Coding Blocks IDE

[asaurabh_26 (logical coder)]

your approach is completely correct

for input
20 8 22 5 3 4 25 -1 -1 10 14 -1 -1 -1 -1 -1 -1 -1 -1
your output
5 10 4 22 25
correct output
5 10 4 14 25

see this i have explained it here in detail

Tree bottom view

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 th…

if you want to ask something about this feel free to ask here
i hope this helps
if yes show your response with and don’t forgot to mark doubt as resolved

[asaurabh_26 (logical coder)]

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.