Leetcode——populating-next-right-pointers-in-each-node
来源:互联网 发布:淘宝9块9包邮参加条件 编辑:程序博客网 时间:2024/06/06 08:40
题目描述
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 toNULL.
Initially, all next pointers are set toNULL.
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) { TreeLinkNode *p = root; TreeLinkNode *ass; while( p != NULL && p->left != NULL){ ass = p; while(ass != NULL){ ass->left->next = ass->right; if( ass->next != NULL){ ass->right->next = ass->next->left; } ass = ass->next; } p = p->left; } }};
0 0
- LeetCode——Populating Next Right Pointers in Each Node
- LeetCode——Populating Next Right Pointers in Each Node
- LeetCode——Populating Next Right Pointers in Each Node
- Leetcode——populating-next-right-pointers-in-each-node
- 【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
- Algorithms—116.Populating Next Right Pointers in Each Node
- LeetCode116—Populating Next Right Pointers in Each Node
- LeetCode117—Populating Next Right Pointers in Each Node II
- 【Leetcode】Populating Next Right Pointers in Each Node in JAVA
- leetcode——116—— Populating Next Right Pointers in Each Node
- leetcode——117——Populating Next Right Pointers in Each Node II
- LeetCode——Populating Next Right Pointers in Each Node II
- leetcode 116 —— Populating Next Right Pointers in Each Node
- leetcode 117 —— Populating Next Right Pointers in Each Node II
- LeetCode 之 Populating Next Right Pointers in Each Node I II — C++ 实现
- LeetCode Populating Next Right Pointers in Each Node
- Eclipse转成Android Studio项目想要添加依赖
- 从Eclipse转移到IntelliJ IDEA一点心得
- PCA主成分分析
- 剑指offer 面试题22:栈的压入、弹出序列 题解
- CodeForces 447B---DZY Loves Strings
- Leetcode——populating-next-right-pointers-in-each-node
- Numpy中矩阵对象(matrix)
- C++ STL Map 学习报告
- UVA 1665 Islands
- jQuery+CSS3实现图片的无缝轮播
- AlertDialog的简单封装
- 开源tinyXMl和OpenCV读写XML文件对比
- Java学习笔记-接口和抽象类
- Android 自定义相机 切换相机 参考线(辅助线) 闪光灯 缩放 自动聚焦 Demo