leetcode——117——Populating Next Right Pointers in Each Node II
来源:互联网 发布:ruby for windows 编辑:程序博客网 时间:2024/06/11 21:52
Follow up for problem "Populating Next Right Pointers in Each Node".
What if the given tree could be any binary tree? Would your previous solution still work?
Note:
- You may only use constant extra space.
For example,
Given the following binary tree,
1 / \ 2 3 / \ \ 4 5 7
After calling your function, the tree should look like:
1 -> NULL / \ 2 -> 3 -> NULL / \ \ 4-> 5 -> 7 -> NULL
/** * 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) { TreeLinkNode* prev = nullptr; TreeLinkNode* next = nullptr; while(root) { prev = nullptr;//当前层的前一个节点 next = nullptr; for( ; root ; root = root->next) { if(next == nullptr) next = root->left ? root->left : root->right;//下一层的第一个节点 if(root->left) { if(prev) prev->next = root->left; prev = root->left; } if(root->right) { if(prev) prev->next = root->right; prev = root->right; } } root = next; } }};
0 0
- LeetCode117—Populating Next Right Pointers in Each Node II
- leetcode——117——Populating Next Right Pointers in Each Node II
- leetcode 117 —— 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
- 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 I II — C++ 实现
- LeetCode 117 Populating Next Right Pointers in Each Node II
- LeetCode: Populating Next Right Pointers in Each Node II [117]
- LeetCode 117 Populating Next Right Pointers in Each Node II
- [leetcode 117] Populating Next Right Pointers in Each Node II
- [LeetCode 117]Populating Next Right Pointers in Each Node II
- leetcode || 117、Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node II - LeetCode 117
- leetcode[117]:Populating Next Right Pointers in Each Node II
- Leetcode #117 Populating Next Right Pointers in Each Node II
- NSUrSession和AFN
- PC SDK PDFs
- 使用Jmeter测试Webservice简单示例
- Unity Official Tutorial --- CREATING A BREAKOUT GAME FOR BEGINNERS
- ios拼图游戏(三)之使用TableView布局
- leetcode——117——Populating Next Right Pointers in Each Node II
- POJ 3321Apple Tree(dfs序 树状数组)
- secureCRT光标不见啦
- 利用referer请求头防止“盗链”
- PHP基础之进制的转换
- 一个xib文件中最有一个view
- Netty的Protobuf开发列子
- 96. Unique Binary Search Trees
- zlib交叉编译