Can you please explain me the logic used here for bottom view?
Bottom view of tree
Hello @div_yanshu07 in this code ‘d’ is the value which is subtracting 1 for the left node and adding 1 for the right node:
the concept in bottom is view is that if the particular value of ‘d’ has occured then also we will rehash it.
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.