LeetCode题解:Populating Next Right Pointers in Each Node
来源:互联网 发布:网络繁忙请稍后再试 编辑:程序博客网 时间:2024/05/24 22:42
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
题意:让给定二叉树的每一层的结点从左到右指向它的右结点,最右边的结点则指向NULL
解决思路:层序遍历
代码:
public class Solution { public void connect(TreeLinkNode root) { while (root != null) { TreeLinkNode curr = root; while (curr != null && curr.left != null) { curr.left.next = curr.right; curr.right.next = curr.next == null ? null : curr.next.left; curr = curr.next; } root = root.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 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
- Populating Next Right Pointers in Each Node题解
- 【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
- IOS开发笔记-01按钮操作-05.IBAction&IBOutlet 06.加法计算器小结 07.关闭键盘
- 1 java程序设计概述
- Unity 下简易状态机的实现
- LeetCode题解:Flatten Binary Tree to Linked List
- codeforces 466D Increase Sequence DP
- LeetCode题解:Populating Next Right Pointers in Each Node
- equal和==的区别(原理讲解)
- Mysql命令大全
- 下载微软虚拟学院视频字幕,解决本地播放没有字幕
- TCP/IP详解卷1 读书笔记:第七章 Ping程序
- LeetCode题解:Triangle
- Java学习笔记----封装和private关键字
- repo 获取Android源码
- LeetCode题解:Best Time to Buy and Sell Stock