116. Populating Next Right Pointers in Each Node
2017-09-13 16:50
281 查看
/* Given a binary tree 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: 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 7 After calling your function, the tree should look like: 1 -> NULL / \ 2 -> 3 -> NULL / \ / \ 4->5->6->7 -> NULL 1.如果可以使用额外空间的话,可以使用一个队列按层遍历; 2.自上而下,利用next指针按层遍历 */ /** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {} * }; */ class Solution { public: void connect(TreeLinkNode *root) { if(!root) return; TreeLinkNode *pre=root; TreeLinkNode *cur=NULL; while(pre->left) { cur=pre; while(cur) { cur->left->next=cur->right; if(cur->next) cur->right->next=cur->next->left; cur=cur->next; } pre=pre->left; } } };
相关文章推荐
- 116. Populating Next Right Pointers in Each Node
- 116. Populating Next Right Pointers in Each Node
- LeetCode力扣之116. Populating Next Right Pointers in Each Node
- leetcode || 116、Populating Next Right Pointers in Each Node
- 116. Populating Next Right Pointers in Each Node
- LeetCode 116. Populating Next Right Pointers in Each Node
- Leetcode_116_Populating Next Right Pointers in Each Node
- LeetCode - 116/117 - Populating Next Right Pointers in Each NodeII
- 116. Populating Next Right Pointers in Each Node
- 116. Populating Next Right Pointers in Each Node
- 116. Populating Next Right Pointers in Each Node
- 116. Populating Next Right Pointers in Each Node
- FTPrep, 116 Populating Next Right Pointers in Each Node, TODO,再多code几遍,虽然总结写得还比较ok,但是还是手感不熟
- LeetCode 116 Populating Next Right Pointers in Each Node 解题报告
- Leetcode 116. Populating Next Right Pointers in Each Node
- [leetcode] 116. Populating Next Right Pointers in Each Node 解题报告
- LeetCode(116) Populating Next Right Pointers in Each Node
- LeetCode 116. Populating Next Right Pointers in Each Node
- 116. Populating Next Right Pointers in Each Node
- Leetcode-116. Populating Next Right Pointers in Each Node