Populating Next Right Pointers in Each Node
来源:互联网 发布:mac系统10.11u盘制作 编辑:程序博客网 时间:2024/05/16 08:27
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* ptr1=root,*ptr2=root; while(ptr1->left){ while(ptr2){ ptr2->left->next=ptr2->right; ptr2->right->next=ptr2->next?ptr2->next->left:NULL; ptr2=ptr2->next; } ptr1=ptr2=ptr1->left; } }};
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
- 下拉菜单
- noip题库 —— 4.7反质数
- iOS SDK:iOS调试技巧
- python3 多线程爬取淘女郎图片并保存
- 【github】Configuring a remote for a fork
- Populating Next Right Pointers in Each Node
- 括号表示转孩子数组表示法
- SWFUpload的初始化与配置
- Servlet学习笔记(一)
- LSTM简介以及数学推导(FULL BPTT)
- 我的投资案例(2)-阿丁特的股东,好狗狗的业务
- Spring中InitializingBean接口使用理解
- context:annotation-config配置和context:component-scan配置
- java keytool证书工具使用小结