Doubt related to Binary tree

#1

why are we not going from root, left and then right ? why right view first?

#2

Hello @vanshikasharma1645 here we have to print the right view then we are first sending the call to the right node.
The concept for the left node and the right node is same is just when we have to print the left view we will make the recursion call for left node first but when we want to do for the right view then right call first.

#3

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.