Populating Next Right Pointers in Each Node
来源:互联网 发布:逆战自动开枪脚本源码 编辑:程序博客网 时间:2024/06/06 00:19
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||root->left==NULL) return; root->left->next=root->right; if(root->next!=NULL) root->right->next=root->next->left; connect(root->left); connect(root->right); }};
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
- 机器学习和计算机视觉相关的数学
- MD5加密
- ListView的第一个item完整显示
- 为什么我要用 Node.js? 案例逐一介绍
- 字符编码问题
- Populating Next Right Pointers in Each Node
- ibatis 的 like模糊查询
- Android Studio学习之版本修改
- 【iOS】判断NSString字符串为空
- 汇编函数万能字符输出以及字符大小转换
- [转]C语言math.h库函数中atan与atan2的区别
- android有时候需要show对话框,但是对话框需要依附于activity,如果没有activity怎么办
- 抽象方法与虚方法的区别
- 使用PostThreadMessage在Win32线程间传递消息