[LeetCode] Populating Next Right Pointers in Each Node 解题报告
2012-12-30 09:27
453 查看
Given a binary tree
You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
[解题报告]
当前层处理完next指针的连接以后,再调用下一级节点。
struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *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
NULL.Initially, all next pointers are set to
NULL.Note:[/b]You may only use constant extra space.
You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
1 / \ 2 3 / \ / \ 4 5 6 7After calling your function, the tree should look like:
1 -> NULL / \ 2 -> 3 -> NULL / \ / \ 4->5->6->7 -> NULL» Solve this problem
[解题报告]
当前层处理完next指针的连接以后,再调用下一级节点。
[code]1: void connect(TreeLinkNode *root) { 2: // Start typing your C/C++ solution below 3: // DO NOT write int main() function 4: if(root == NULL) return; 5: if(root->left != NULL) 6: root->left->next = root->right; 7: if(root->right !=NULL) 8: root->right->next = root->next? root->next->left:NULL; 9: connect(root->left); 10: connect(root->right); 11: }
相关文章推荐
- [LeetCode]Populating Next Right Pointers in Each Node II, 解题报告
- LeetCode解题报告——Convert Sorted List to Binary Search Tree & Populating Next Right Pointers in Each Node & Word Ladder
- LeetCode: Populating Next Right Pointers in Each Node 解题报告
- Leetcode 116. Populating Next Right Pointers in Each Node 链接邻居 解题报告
- LeetCode: Populating Next Right Pointers in Each Node II 解题报告
- [Leetcode] 116. Populating Next Right Pointers in Each Node 解题报告
- [LeetCode] Populating Next Right Pointers in Each Node II 解题报告
- [LeetCode] Populating Next Right Pointers in Each Node 解题报告
- LeetCode 116 Populating Next Right Pointers in Each Node 解题报告
- [LeetCode] Populating Next Right Pointers in Each Node II 解题报告
- [leetcode] 116. Populating Next Right Pointers in Each Node 解题报告
- leetCode 116.Populating Next Right Pointers in Each Node (为节点填充右指针) 解题思路和方法
- Leetcode 117. Populating Next Right Pointers in Each Node II 链接邻居2 解题报告
- leetCode 116.Populating Next Right Pointers in Each Node (为节点填充右指针) 解题思路和方法
- 【LeetCode】117.Populating Next Right Pointers in Each Node II(Medium)解题报告
- LeetCode - Populating Next Right Pointers in Each Node
- LeetCode - Populating Next Right Pointers in Each Node II
- Leetcode Populating Next Right Pointers in Each Node II
- LeetCode | Populating Next Right Pointers in Each Node II
- 【LeetCode】Populating Next Right Pointers in Each Node