leetcode - Populating Next Right Pointers in Each Node II
来源:互联网 发布:诺基亚6120c软件 编辑:程序博客网 时间:2024/05/01 07:36
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) {} * }; */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 *head = NULL;TreeLinkNode *prev = NULL;TreeLinkNode *cur = root;while(cur != NULL){while(cur != NULL){if(cur->left != NULL){if(prev != NULL){prev->next = cur->left;}else{head = cur->left;}prev = cur->left;}if(cur->right != NULL){if(prev != NULL){prev->next = cur->right;}else{head = cur->right;}prev = cur->right;}cur = cur->next;}cur = head;head = NULL;prev = NULL;} }};
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 II
- [Leetcode] Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node II
- leetcode 79: 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 II
- 【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 II
- 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 II
- 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 II
- 【LeetCode OJ】Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node II
- hdu 4585 Shaolin 2013 ACM-ICPC杭州赛区全国邀请赛——题目重现
- cocos2d::Vector最佳用法
- 卸载虚拟机后无法上网但能上QQ
- MFC 扩展DLL中使用STL 问题
- visual svnserver 安装失败(服务启动失败)解决方法
- leetcode - Populating Next Right Pointers in Each Node II
- repo使用
- android_定义多个Activity及跳转
- 下载最新的spring框架
- Java内存泄露的理解与解决(转)
- [数据库]sql之left join、right join、inner join的区别
- 使用API创建AR 定金发票
- C变量和函数的存储类型
- UVA11992 - Fast Matrix Operations(线段树区间修改)