[Leetcode]116_Populating Next Right Pointers in Each Node

# Definition for binary tree with next pointer.
# class TreeLinkNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#         self.next = None

class Solution(object):
    def connect(self, root):
        """
        :type root: TreeLinkNode
        :rtype: nothing
        """
        if root == None:
            return root
        
        cur_level = [root]
        while cur_level:
            for i in range(len(cur_level)):
                if i == len(cur_level) - 1:
                    cur_level[-1].next = None
                else:
                    cur_level[i].next = cur_level[i+1]
            next_level = []
            for n in cur_level:
                if n.left:
                    next_level.append(n.left)
                if n.right:
                    next_level.append(n.right)
            cur_level = next_level

class Solution2(object):
    def connect(self, root):
        """
        :type root: TreeLinkNode
        :rtype: nothing
        """
        if root == None or root.left == None:
            pass 
        else:
            self.helper(root.left, root.right)
        
    def helper(self, left, right):
        left.next = right
        if left.left != None:
            self.helper( left.left  , left.right)
            self.helper( left.right , right.left)
            self.helper( right.left , right.right)

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE