leetcode_question_116 Populating Next Right Pointers in Each Node
来源:互联网 发布:上网记录监控软件 编辑:程序博客网 时间:2024/05/25 23:59
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 toNULL
.
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
BFS:
/** * 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) {} * }; */class Solution {public: void connect(TreeLinkNode *root) { // Start typing your C/C++ solution below // DO NOT write int main() function if(root==NULL)return; vector<TreeLinkNode*> vec;vec.push_back(root);int count = 1;while(!vec.empty()){if(count > 1) vec[0]->next = vec[1];else vec[0]->next = NULL;if(vec[0]->left) vec.push_back(vec[0]->left);if(vec[0]->right) vec.push_back(vec[0]->right);vec.erase(vec.begin());count--;if(count == 0)count = vec.size();} }};
- leetcode_question_116 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
- HashMap存储分析
- STM32仿真停在0x08001460 BEAB BKPT 0xAB这个_sys_open代码下
- DML误操作基于时间点的不完全恢复
- 二值化方法总结——附录程序
- android WIFI学习总结
- leetcode_question_116 Populating Next Right Pointers in Each Node
- DDL误操作基于scn的不完全恢复
- 线性表的-顺序表
- 弹出层
- VMware下安装Redhat
- 【leetcode】Path Sum II
- XSS绕过
- 屌丝程序员之路!
- leetcode_question_117 Populating Next Right Pointers in Each Node II