LeetCode:Populating Next Right Pointers in Each Node
来源:互联网 发布:ubuntu deb 安装 编辑:程序博客网 时间:2024/04/27 19:13
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
递归一定还要学会好好运用。
// Source : https://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/// Author : Chao Zeng // Date : 2014-12-19 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;if (root->left != NULL)root->left->next = root->right;if (root->right != NULL)root->right->next = root->next ? root->next->left : NULL;connect(root->left);connect(root->right);}};
0 0
- 【LeetCode】Populating Next Right Pointers in Each Node Populating Next Right Pointers in Each Node II
- leetcode Populating Next Right Pointers in Each Node &&Populating Next Right Pointers in Each Node||
- LeetCode Populating Next Right Pointers in Each Node & Populating Next Right Pointers in Each Node I
- 【Leetcode】Populating Next Right Pointers in Each Node in JAVA
- 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
- 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
- [LeetCode] Populating Next Right Pointers in Each Node II
- 【leetcode】 Populating Next Right Pointers in Each Node
- leetcode 78: Populating Next Right Pointers in Each Node
- leetcode 79: Populating Next Right Pointers in Each Node II
- 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
- 百度投资UBER 车联网之路取其轻
- myeclipse异常:An internal error occurred during
- IO--Reader
- 酒店智能门锁的秘密
- 数据结构小知识
- LeetCode:Populating Next Right Pointers in Each Node
- hibernate 表名大小写,mysql表名忽略大小写
- STL的remove函数和list的remove成员函数
- Eclipse常用快捷键
- 关于mysql执行效率优化注意事项及要点(上)
- 简单优化:Zipalign
- Android OTA 升级(一): 编译升级包
- 2014年让人脑洞大开的智能产品
- Android OTA 升级(二): 脚本 ota_from_target_files