[leetcode] 117. Populating Next Right Pointers in Each Node II @ python
原题https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/解法BFS,依次将每层的节点放入列表中,然后每个列表的节点都指向它下一个节点.代码"""#DefinitionforaNode.classNode(object):def__init__(self,val,left,right,next):s