Leetcode_populating-next-right-pointers-in-each-node(updated c++ and python version)

地址：http://oj.leetcode.com/problems/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

思路：最开始想到的是层序遍历，题目里说明了树是满二叉数，即若一个结点有左子树，那么其一定也有右子树。每一层控制节点数量。虽然也AC了但是好像空间复杂度是O(logN). 

用递归解的方法更好，而且符合题意，虽然系统递归的开销应该也挺大的。

c++参考代码：

class Solution {
public:
    void connect(TreeLinkNode *root) {
        if(root && root->left)
        {
            if(root->next)
                root->right->next = root->next->left;

            root->left->next = root->right;
            connect(root->left);
            connect(root->right);
        }
    }
};

extra space O(lgn) 参考代码：

class Solution {
public:
    void connect(TreeLinkNode *root) {
        if(root)
        {
            int levelsum = 1;
            TreeLinkNode* p = root, *pre = NULL, *cur = NULL;
            queue<TreeLinkNode*>q;
            q.push(p);
            while(!q.empty())
            {
                for(int i = 0; i<levelsum; ++i)
                {
                    cur = q.front();
                    if(cur->left)
                    {
                        q.push(cur->left);
                        q.push(cur->right);
                    }
                    if(pre)
                        pre->next = cur;
                    pre = cur;
                    q.pop();
                }
                cur->next = pre = NULL;
                levelsum*=2;
            }
        }
    }
};

python:

#Defition for a  binary tree node
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#         self.next = None

class Solution:
    # @param root, a tree node
    # @return nothing
    def connect(self, root):
        if not root:
            return
        if root.left:
            root.left.next = root.right
            if root.next:
                root.right.next = root.next.left
            self.connect(root.left)
            self.connect(root.right)