116. Populating Next Right Pointers in Each Node

Given a binary tree

struct TreeLinkNode {
  TreeLinkNode *left;
  TreeLinkNode *right;
  TreeLinkNode *next;
}

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

Initially, all next pointers are set to NULL.

Note:

You may only use constant extra space.
You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
1
/ \
2 3
/ \ / \
4 5 6 7
After calling your function, the tree should look like:
1 -> NULL
/ \
2 -> 3 -> NULL
/ \ / \
4->5->6->7 -> NULL
Subscribe to see which companies asked this question
非递归的方法–采用层次遍历的思想（运行时间好长，low）

//非递归的层次遍历
    void connect(TreeLinkNode *root) {
        if(NULL == root)
            return;

        queue<TreeLinkNode*> que;
        que.push(root);
        int curLenNode = 1;
        TreeLinkNode* pre = NULL;
        while(!que.empty())
        {
            TreeLinkNode *temp = que.front();
            que.pop();
            curLenNode --;
            if(pre != NULL)
                pre->next = temp;
            pre = temp;
            if(temp->left)
                que.push(temp->left);
            if(temp->right)
                que.push(temp->right);

            if(curLenNode == 0)
            {
                pre = NULL; //注意在每一层遍历结束，都要将pre设置为NULL，否则Pre保留的是上一层的最后一个节点，故而会有问题
                temp->next = NULL;//最每一层的最后会将当前层的最后一个节点的next赋值为NULL
                curLenNode = que.size();
            }

        }
    }

非递归的方法—运行时间更短，perfect–值得好好推敲的代码

void connect(TreeLinkNode *root) {
        if(!root)
        return;
        while(root -> left)
        {
            TreeLinkNode *p = root;
            while(p)//一层一层的去连接next指针
            {
                p -> left -> next = p -> right;
                if(p -> next)
                    p -> right -> next = p -> next -> left;
                p = p -> next;
            }
            root = root -> left;
        }
    }