Leetcode question

#1


can you explain this question

#2

you just have to convert a binary tree into sting format

approach

  1. use recursion
  2. first add curr val to string and then call left and right half

see this code

#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.