[leetcode] Populating Next Right Pointers in Each Node
来源:互联网 发布:网络赚钱棋牌游戏 编辑:程序博客网 时间:2024/06/05 15:02
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) {// Start typing your C/C++ solution below// DO NOT write int main() function if(!root) return;TreeLinkNode** array=new TreeLinkNode*[10000];array[0]=root;int p,q,flag;for(p=0,q=1,flag=1 ; p!=q ; p++ ){if(p==flag){for(int i=p ; i<q-1 ; i++){array[i]->next=array[i+1];}flag=q;}if(array[p]->left)array[q++]=array[p]->left;if(array[p]->right)array[q++]=array[p]->right;}}};
- 【LeetCode】Populating Next Right Pointers in Each Node Populating Next Right Pointers in Each Node II
- leetcode Populating Next Right Pointers in Each Node &&Populating Next Right Pointers in Each Node||
- LeetCode Populating Next Right Pointers in Each Node & Populating Next Right Pointers in Each Node I
- 【Leetcode】Populating Next Right Pointers in Each Node in JAVA
- LeetCode Populating Next Right Pointers in Each Node
- LeetCode Populating Next Right Pointers in Each Node II
- [Leetcode] Populating Next Right Pointers in Each Node
- LeetCode: Populating Next Right Pointers in Each Node
- [Leetcode] Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node
- [LeetCode] Populating Next Right Pointers in Each Node II
- 【leetcode】 Populating Next Right Pointers in Each Node
- leetcode 78: Populating Next Right Pointers in Each Node
- leetcode 79: Populating Next Right Pointers in Each Node II
- Leetcode: Populating Next Right Pointers in Each Node
- [Leetcode] 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
- The Land of Justice
- 后缀数组论文题目
- How Many Points of Intersection?
- disassambe c++ source code
- Searching for Nessy
- [leetcode] Populating Next Right Pointers in Each Node
- Quotient Polynomial
- 编程原则
- Android 之 下拉框(Spinner)的使用
- VB.net学习笔记(十五)继承与多接口练习
- (2/3/4)-D Sqr/Rects/Cubes/Boxes?
- 黑马程序员 集合学习笔记二
- 几种古典密码学算法
- Factstone Benchmark