leetcode_c++:树: Populating Next Right Pointers in Each Node(116)
2016-08-26 15:32
513 查看
Given a binary tree
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,
After calling your function, the tree should look like:
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
class Solution { public: void connect(TreeLinkNode *root) { TreeLinkNode header(0); header.next = root; TreeLinkNode *cur, *prev; while (header.next) { // current header's link is already populated // following will make a new children-link to header cur = header.next; prev = &header; header.next = nullptr; for (; cur; cur = cur->next) { if (cur->left != nullptr) { prev->next = cur->left; prev = prev->next; } if (cur->right != nullptr) { prev->next = cur->right; prev = prev->next; } } } } };
相关文章推荐
- [leetcode-116]Populating Next Right Pointers in Each Node(c++)
- [leetcode-116]Populating Next Right Pointers in Each Node(c++)
- LeetCode 116 Populating Next Right Pointers in Each Node
- Leetcode 笔记 116 - Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node - LeetCode 116
- LeetCode 116: Populating Next Right Pointers in Each Node
- Leetcode 116 Populating Next Right Pointers in Each Node 二叉树填充next指针指向右侧结点
- [LeetCode 116 117] - 填充每一个节点的指向右边邻居的指针I & II (Populating Next Right Pointers in Each Node I & II)
- leetcode_question_116 Populating Next Right Pointers in Each Node
- Java for LeetCode 116 Populating Next Right Pointers in Each Node
- Leetcode_116_Populating Next Right Pointers in Each Node
- leetcode116 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_populating-next-right-pointers-in-each-node(updated c++ and python version)
- LeetCode 之 Populating Next Right Pointers in Each Node I II — C++ 实现
- [C++]LeetCode: 123 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