[leetcode] Populating Next Right Pointers in Each Node II | 把二叉树横向next节点populate了

很简单的题，因为熟悉了用两个list做tree的bfs，所以这里一层一层iterate就行了，上一层反正已经做完了，所以能直接横着遍历上一层，把下一层populate了。轻松过。

Enter your comment here...

Fill in your details below or click an icon to log in:

Email (required) (Address never made public)

Name (required)

Website

You are commenting using your WordPress.com account. ( Log Out / Change )

You are commenting using your Google account. ( Log Out / Change )

You are commenting using your Twitter account. ( Log Out / Change )

You are commenting using your Facebook account. ( Log Out / Change )

Connecting to %s

Lexi's Leetcode solutions