Leetcode 117. Populating Next Right Pointers in Each Node II (Hard) (cpp)
来源:互联网 发布:mac .git文件夹 编辑:程序博客网 时间:2024/05/16 07:01
Leetcode 117. Populating Next Right Pointers in Each Node II (Hard) (cpp)
Tag: Tree, Depth-first Search
Difficulty: Hard
/*117. Populating Next Right Pointers in Each Node II (Hard)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 7After 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) {if (root == NULL) {return;}queue<TreeLinkNode*> q;q.push(root);while (!q.empty()) {int _size = q.size();for (int i = 0; i < _size; i++) {TreeLinkNode* node = q.front();q.pop();if (i < _size - 1) {node->next = q.front();}else {node->next = NULL;}if (node->left != NULL) {q.push(node->left);}if (node->right != NULL) {q.push(node->right);}}}}};
0 0
- Leetcode 117. Populating Next Right Pointers in Each Node II (Hard) (cpp)
- 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
- [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
- 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
- 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
- [LeetCode] 117. Populating Next Right Pointers in Each Node II
- 448. Find All Numbers Disappeared in an Array
- 一行代码解决百度分享无法动态传递参数问题
- Leetcode 297. Serialize and Deserialize Binary Tree (Hard) (cpp)
- IO BufferedInputStream
- IO BufferedOutputStream
- Leetcode 117. Populating Next Right Pointers in Each Node II (Hard) (cpp)
- exercise 5 多变量
- 使用buffer拷贝文件
- 169. Majority Element
- Array126FindPeakElement
- nginx事件模块之客户端连接与超时管理
- jsp页面取得物理路径的方法
- Array216CombinationSum3
- Ogre1.9SDK学习笔记(一)序