leetcode Populating Next Right Pointers in Each Node II
来源:互联网 发布:2016淘宝永久封店解封 编辑:程序博客网 时间:2024/04/28 09:06
Follow up for problem "Populating Next Right Pointers in Each Node".
What if the given tree could be any binary tree? Would your previous solution still work?
Note:
- You may only use constant extra space.
For example,
Given the following binary tree,
1 / \ 2 3 / \ \ 4 5 7
After calling your function, the tree should look like:
1 -> NULL / \ 2 -> 3 -> NULL / \ \ 4-> 5 -> 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) { // Start typing your Java solution below // DO NOT write main() function if(root==null) return; TreeLinkNode current=null,tmp=null; while(root!=null){ if(root.left!=null){ if(tmp==null) tmp=root.left; if(current==null) current=root.left; else{ current.next=root.left; current=root.left; } } if(root.right!=null){ if(tmp==null) tmp=root.right; if(current==null) current=root.right; else{ current.next=root.right; current=root.right; } } root=root.next; } connect(tmp); }}
- 【LeetCode】Populating Next Right Pointers in Each Node Populating Next Right Pointers in Each Node II
- LeetCode Populating Next Right Pointers in Each Node II
- [Leetcode] Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node II
- leetcode 79: Populating Next Right Pointers in Each Node II
- [Leetcode] Populating Next Right Pointers in Each Node ii
- leetcode Populating Next Right Pointers in Each Node II
- 【leetcode】Populating Next Right Pointers in Each Node II
- [Leetcode]Populating Next Right Pointers in Each Node II
- [leetcode] Populating Next Right Pointers in Each Node II
- LeetCode-Populating Next Right Pointers in Each Node II
- LeetCode - Populating Next Right Pointers in Each Node II
- [LeetCode]Populating Next Right Pointers in Each Node II
- leetcode Populating Next Right Pointers in Each Node II
- LeetCode | Populating Next Right Pointers in Each Node II
- [leetcode]Populating Next Right Pointers in Each Node II
- 【LeetCode OJ】Populating Next Right Pointers in Each Node II
- [LeetCode] Populating Next Right Pointers in Each Node II
- pre_forum_post中invisible字段说明
- 将任意查询结果ResultSet转化成List<Map>
- Spark——最简单明了的Java Web框架(1)
- Agile Paris - Games
- 在Linux下MySQL数据库的备份与还原。
- leetcode Populating Next Right Pointers in Each Node II
- SS7信令系统协议简介
- Implementation of Strassen’s Algorithm for Matrix Multiplication
- “零基础”学习WinCE开发
- osggeodeme例子
- 插入排序
- 第六章Oracle恢复内部原理(介质恢复)
- osggeometry例子
- jQuery 入门教程(23): jQuery UI Autocomplete示例(一)