Can you pls check the code its not printing anything

#1
#2

image
here’s the mistake. it should be start > end

#3

can you pls explain line no 20,21,22, as how does this recursive function works ,when we give input 1 2 3 4 5 6 7. first 4 is printed then mid-1 is passed now pos 0+2/2= pos 1 is printed and can you explain what happens after printing 1 how it returns and prints 3.

#4

so here 4 is considered as root node. then recursively left and right sub trees are generated. for more details u can refer videos in course. bhaiya has explained everything very well

#5

is this question in video? couldnt find it

#6

u will get similar concepts in video about how trees are created and all

#7

okay;) thanks,

#8

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.