leetcode 117 Populating Next Right Pointers in Each Node II
来源:互联网 发布:windows xp字体大小 编辑:程序博客网 时间:2024/06/05 16:48
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
Subscribe to see which companies asked this question
class Solution {public:void connect(TreeLinkNode *root) {if(root == NULL) return;while(true) {TreeLinkNode *node=NULL, *temp=NULL;bool flag=false;for(; root!=NULL; root=root->next) {node = root->left;flag = false;if(node==NULL) {node = root->right;flag = true;}if(node!=NULL) break;}temp = node;int cnt=1;if(node==NULL) break;if(flag) {cnt++;root = root->next;}for(; root!=NULL; root=root->next) {if(cnt>1) {if(root->left!=NULL) {node->next = root->left;node = root->left;}}node->next = root->right;if(node->next!=NULL)node = node->next;cnt++;}root = temp;}return;}}
0 0
- 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
- 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】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
- PHP中htmlentities和 htmlspecialchars区别
- ROS Python No such file or directory
- 【Android官方文档】翻译Android官方文档-Services(二)
- 深入理解SpringMVC-基础篇
- centos7下安装php7
- leetcode 117 Populating Next Right Pointers in Each Node II
- LeetCode:Binary Tree Right Side View
- 51单片机学习-准备工作
- CRM项目总结
- SQL数据库基础知
- 在 Linux 下你所不知道的 df 命令的那些功能
- LabVIEW 中使用dll
- JDK安装与环境变量配置
- linux驱动程序中的异步编程