Populating Next Right Pointers in Each Node
来源:互联网 发布:基于php的答题系统 编辑:程序博客网 时间:2024/06/06 14:20
- 问题
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
- 解答
class Solution {public: void connect(TreeLinkNode *root) { if(root==NULL) return ; ret=levelOrder(root); for(int i=0;i<ret.size();i++) { for(int j=0;j<ret[i].size()-1;j++) { ret[i][j]->next=ret[i][j+1]; } ret[i][ret[i].size()-1]=NULL; } }private: vector<vector<TreeLinkNode *>> ret;public: void solve(int dep, TreeLinkNode *root) { if (root == NULL) return; if (ret.size() > dep) { ret[dep].push_back(root); } else { vector<TreeLinkNode *> a; a.push_back(root); ret.push_back(a); } solve(dep + 1, root->left); solve(dep + 1, root->right); } vector<vector<TreeLinkNode *>> levelOrder(TreeLinkNode *root) { // Start typing your C/C++ solution below // DO NOT write int main() function ret.clear(); solve(0, root); return ret; }};
0 0
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node
- html标签特效代码大全(让你制作漂亮的页面效果)
- 收集成语单词
- C语言开发总结(一)
- Understanding HDFS Recovery Processes (Part 1)
- 页面跳转
- Populating Next Right Pointers in Each Node
- Ⅰ.5 如何使用事件句柄
- Eclipse安装Scala插件
- 数据分析实例:在一线城市的你,生活有多苦逼
- VMware虚拟机虚拟磁盘的分割与合并
- 排序算法学习总结
- jw player 配置参数
- css常用e设置
- 图片像素、大小、分辨率的关系