Given the root of a binary tree, flatten it to a linked list in-place (using right pointers, in preorder).
Input: [1,2,5,3,4,null,6] Output: 1->2->3->4->5->6 (as right-linked list)
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features