Can we solve this problem by different method?

Like if take a list(STL) and traverse tree inorder wise and keep on adding into the list will that not work?
and can I use this like this approach in interview

The main idea behind the entire question is not to take any additional node, u must do it in-place, that can only be done with amending the node link.

Yes u can first speak up your approach of using inroder traversal and then appending nodes, but on being asked for an efficient method u have to come up with something that works in- place.

Happy to help,
Keep Coding

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.