[leetcode] 116. Populating Next Right Pointers in Each Node

Description You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition: struct Node { int val; Node

>>阅读原文<<