[leetcode] Populating Next Right Pointers in Each Node
来源:互联网 发布:java导出至excel表格 编辑:程序博客网 时间:2024/05/28 22:09
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思路:左节点的next等于父节点的右节点,右节点的next等于父节点的next的左节点,然后进行递归
代码:
/** * 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; if(root->left==NULL && root->right==NULL) return; if(root->left!=NULL){ if(root->right!=NULL){ root->left->next=root->right; } else root->left->next=NULL; connect(root->left); } if(root->right!=NULL){ if(root->next!=NULL){ root->right->next=root->next->left; } else root->right->next=NULL; connect(root->right); } }};
0 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
- Linux下使用Samba服务器举例
- Mahout之bayes算法学习(一)
- 向浏览器输出excel文件的简单办法,不依赖第三方类库
- 童年汇---在游戏中教与学
- [NWPU][2014][TRN][3]搜索 总结
- [leetcode] Populating Next Right Pointers in Each Node
- Struts2+Hibernate4+Spring4整合
- logback的日期和文件大小共同作用日志分割
- TOMCAT服务器配置域名
- 【微信公众平台开发】利用百度接口,制作一键导航功能
- java中byte转换int时为何与0xff进行与运算
- vc的web控件缓存问题
- linux常用命令大全
- linux Redhat 卸载openjdk,安装sun JDK1.7