116. Populating Next Right Pointers in Each Node
2016-03-09 09:20
405 查看
Given a binary tree
struct TreeLinkNode {
TreeLinkNode *left;
TreeLinkNode *right;
TreeLinkNode *next;
}
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.
Initially, all next pointers are set to NULL.
Note:
You may only use constant extra space.
You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
1
/ \
2 3
/ \ / \
4 5 6 7
After calling your function, the tree should look like:
1 -> NULL
/ \
2 -> 3 -> NULL
/ \ / \
4->5->6->7 -> NULL
结题报告:
使用一个指针队列保存树结点,并记录结点索引(从1开始),每层的最后一个结点的next指向null,同层其他结点指向其下一个兄弟结点,每层最后一个结点的索引分别为1,3,7,15,k… 可以看出 k+1是2的幂次方(使用 x&(x-1)==0?判断是否为2的幂次方)。
方法与上类似,只是使用vector来存储树结点。。
struct TreeLinkNode {
TreeLinkNode *left;
TreeLinkNode *right;
TreeLinkNode *next;
}
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.
Initially, all next pointers are set to NULL.
Note:
You may only use constant extra space.
You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
1
/ \
2 3
/ \ / \
4 5 6 7
After calling your function, the tree should look like:
1 -> NULL
/ \
2 -> 3 -> NULL
/ \ / \
4->5->6->7 -> NULL
结题报告:
使用一个指针队列保存树结点,并记录结点索引(从1开始),每层的最后一个结点的next指向null,同层其他结点指向其下一个兄弟结点,每层最后一个结点的索引分别为1,3,7,15,k… 可以看出 k+1是2的幂次方(使用 x&(x-1)==0?判断是否为2的幂次方)。
class Solution { public: // 28ms void connect(TreeLinkNode *root) { queue<TreeLinkNode*>q; if(root==NULL)return ; q.push(root); int k=0; while(!q.empty()){ TreeLinkNode*p=q.front(); q.pop(); k++; if(((k+1)&k)!=0&&!q.empty())p->next=q.front(); if(p->left!=NULL)q.push(p->left); if(p->right!=NULL)q.push(p->right); } } }; |
class Solution { public: // 24ms void connect(TreeLinkNode *root) { vector<TreeLinkNode*>q; if(root==NULL)return ; q.push_back(root); int k=0; while(k<q.size()){ TreeLinkNode*p=q[k++]; if(((k+1)&k)!=0&&!q.empty())p->next=q[k]; if(p->left!=NULL)q.push_back(p->left); if(p->right!=NULL)q.push_back(p->right); } } }; |
相关文章推荐
- Nodejs基础中间件Connect
- 理解Node.js中间件以及Connect 模块
- Nodejs如何复制文件
- convertToNodeSpace和convertToWorldSpace
- node.js获得参数的三种方式。
- nodejs npm 全局安装路径和本地安装路径区别
- nodejs介绍
- [nodejs] nodejs开发个人博客(三)载入页面
- pomelo nodejs 调试走起
- JS nodeType返回类型
- LeetCode : Reverse Nodes in k-Group [java]
- 第一天:NodeJs Windows环境搭建、学习资料地址、注意事项总结
- Node.js笔记之简介
- [node] ejs模板手册
- leetcode 25. Reverse Nodes in k-Group
- leetcode 24. Swap Nodes in Pairs
- [nodejs] cookie操作
- Wrtnode 配置方法:
- [LeetCode][JavaScript]Swap Nodes in Pairs
- [leetcode] 237. Delete Node in a Linked List