populating-next-right-pointers-in-each-node.txt

# Definition 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 root == None:
			return
		p = root
		while p.left != None:
			q = p
			while q.next != None:
				q.left.next = q.right
				q.right.next = q.next.left
				q = q.next
			q.left.next = q.right
			p = p.left