Leetcode "populating next right pointers in each node"

Apparently BFS is the most obvious one .. but it is not that simple-only constant extra space is provided.

Then the only strategy to take is recursion. I bogged down for quite while .. only after checked http://leetcode.com/2010/03/first-on-site-technical-interview.html, I got enlightment:Pick a pen and a piece of paper, and simulate the procedure by drawing-This strategy is working so well on digoal-like problems! Just like"Starting from enumeration and check Pattern"Strategy, a good solution starts from basics.

class Solution {public:    void connect(TreeLinkNode *p) {        if (!p) return;        if (p->left)    p->left->next = p->right;    // with the same parent        if (p->right)    p->right->next = (p->next) ? p->next->left : NULL;        connect(p->left);        connect(p->right);    }};