[leetcode] 117. Populating Next Right Pointers in Each Node II

Description Given a binary tree 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 ne

>>阅读原文<<