[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 *left; Node *right; Node *next; } Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to..
