leetcode_c++:树: Populating Next Right Pointers in Each Node(116)
来源:互联网 发布:考试软件哪个好 编辑:程序博客网 时间:2024/06/08 07:17
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
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; } } } }};
0 0
- leetcode_c++:树: Populating Next Right Pointers in Each Node(116)
- 116:Populating Next Right Pointers in Each Node【树】【DFS】
- leetcode_c++:树:Populating Next Right Pointers in Each Node II(117)
- LeetCode(116) Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- 覆盖索引
- 编程中 常见的位运算问题
- MySQL单实例安装
- (二)mysql 优化相关
- 转换英文日期
- leetcode_c++:树: Populating Next Right Pointers in Each Node(116)
- Android三种方式实现视频
- TensorFlow源代码学习--1 Session API reference
- Qt 开启自启动程序 启动后仍可读取本地文件
- 提高你开发效率的十五个Visual Studio 2010使用技巧
- VO、DTO、DO、PO的概念、区别和用处
- Ubuntu 通过SSH远程登录
- java.lang.NoSuchFieldError
- linux+mysql数据导出的一般过程