leetcode 117 Populating Next Right Pointers in Each Node II
2016-06-11 13:58
609 查看
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,
After calling your function, the tree should look like:
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;
}
}
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;
}
}
相关文章推荐
- leetcode 116 Populating Next Right Pointers in Each Node
- nodemcu的gpio相关操作
- 使用淘宝镜像访问node包
- 将单链表中相邻两节点对换
- Datanode JPS
- Node.js基本语法简介
- leetcode 19. Remove Nth Node From End of List
- 117. Populating Next Right Pointers in Each Node II
- 116. Populating Next Right Pointers in Each Node
- Node.js: exports与module.exports的区别
- nodejs模块加载的猜想
- nodejs的模块引用
- Node.js 实用工具
- nodejs特性
- openwrt 编译node.js功能(解决Illegal instruction错误)
- Node.js CSV导入功能,上传并读取
- hadoop集群中datanode启动几秒钟自动关闭
- Delete Node in a Linked List
- [TypeScript] Using Typings and Loading From node_modules
- [LeetCode]problem 117. Populating Next Right Pointers in Each Node II