leetcode:Populating Next Right Pointers in Each Node 【Java】
来源:互联网 发布:网络攻防平台 编辑:程序博客网 时间:2024/05/20 21:23
一、问题描述
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. * public class TreeLinkNode { * int val; * TreeLinkNode left, right, next; * TreeLinkNode(int x) { val = x; } * } */public class Solution { public void connect(TreeLinkNode root) { connect(root, null); } public void connect(TreeLinkNode root, TreeLinkNode sibling){ if(root == null){ return; }else{ root.next = sibling; } connect(root.left, root.right); if(sibling != null){ connect(root.right, sibling.left); }else{ connect(root.right, null); } }}
0 0
- 【Leetcode】Populating Next Right Pointers in Each Node in JAVA
- [Leetcode] Populating Next Right Pointers in Each Node (Java)
- [Leetcode] Populating Next Right Pointers in Each Node II (Java)
- [LeetCode][Java] Populating Next Right Pointers in Each Node
- [LeetCode][Java] Populating Next Right Pointers in Each Node II
- leetcode:Populating Next Right Pointers in Each Node 【Java】
- leetcode:Populating Next Right Pointers in Each Node II 【Java】
- Populating Next Right Pointers in Each Node Python Java Leetcode
- leetcode-java-116. Populating Next Right Pointers in Each Node
- 【leetcode】116. Populating Next Right Pointers in Each Node【java】
- LeetCode-116. Populating Next Right Pointers in Each Node (JAVA)
- LeetCode-117. Populating Next Right Pointers in Each Node || (JAVA)
- 【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
- LeetCode Populating Next Right Pointers in Each Node II
- [Leetcode] Populating Next Right Pointers in Each Node
- android之bitmap-xml文件属性详解
- spring mvc IE8下JSP页面form表单提交后台不能获取值
- 258. Add Digits
- golang 长短连接处理
- mysql优化笔记
- leetcode:Populating Next Right Pointers in Each Node 【Java】
- Binary Tree Postorder Traversal
- 欢迎使用CSDN-markdown编辑器
- 20160307 Add Digits
- Android JNI编程规范
- android中JNI调用时内存分布以及内存泄露原因分析
- 【nova】centos7下libety版本openstack动态迁移虚拟机
- [译]使用注解处理器生成代码-3 生成源代码
- 第2章 jQuery之基础核心