LeetCode--Populating Next Right Pointers in Each Node
来源:互联网 发布:淘宝网拍模特流程 编辑:程序博客网 时间:2024/06/05 09: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
/** * 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) { if(root == NULL) return ; TreeLinkNode* temp = root; while(temp->left!=NULL) { TreeLinkNode* t = temp; while(t!=NULL) { t->left->next = t->right; if(t->next != NULL) t->right->next = t->next->left; t = t->next; } temp = temp->left; } return ; }};
1 0
- 【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
- js获取表单数据
- Linux串口(serial、uart)驱动程序设计
- apt-get 使用详解
- XML文件<xliff:g>标签介绍:
- win7环境中编写的C#程序无法在xp中运行
- LeetCode--Populating Next Right Pointers in Each Node
- php调用远程数据
- CentOS 6.5安装pip
- tomcat7如何修改默认端口和用户名密码?
- LeetCode171——Excel Sheet Column Number
- window7 访问ubuntu 共享 登录失败:未知的用户名或错误密码
- openlog、syslog和closelog函数
- java-多线程深入(四)Volatile分析
- JVM内存回收机制简述