LeetCode 116. Populating Next Right Pointers in Each Node(右邻)
原题网址:https://leetcode.com/problems/populating-next-right-pointers-in-each-node/
Given a binary tree
struct TreeLinkNode {
TreeLinkNode *left;
TreeLinkNode *right;
TreeLinkN
原创
2016-05-24 00:19:38 ·
361 阅读 ·
0 评论