给定一个完美二叉树,其所有叶子节点都在同一层,每个父节点都有两个子节点。
初始情况所有next节点都为null,现在将每层的点加上next指针,如上图
分析思路:
因为给定的树为完美二叉树,所以如果一个点不是叶子节点,就必有左节点和右节点
**结论1:**一个节点如果左节点不为空,则左节点的next必为右节点
因为所有叶子节点都在同一层,因此如果父节点有next节点,且该节点必有next节点
**结论2:**一个右节点的父节点如果有next节点,则右节点的next必为父节点的next的左节点
综上,代码如下:
"""
# Definition for a Node.
class Node:
def __init__(self, val, left, right, next):
self.val = val
self.left = left
self.right = right
self.next = next
"""
class Solution:
def connect(self, root: 'Node') -> 'Node':
if root is None:
return None
father = root
while father.left:
left = father.left
cur = father.left
cur.next = father.right
while father.next:
cur.next.next = father.next.left
father = father.next
cur = father.left
cur.next = father.right
father = left
return root