【LeetCode从零单排】No 114 Flatten Binary Tree to Linked List
来源:互联网 发布:最好的矩阵论教材 编辑:程序博客网 时间:2024/05/14 12:03
题目
Given a binary tree, flatten it to a linked list in-place.
For example,
Given
1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like:
1 \ 2 \ 3 \ 4 \ 5 \ 6
解题思路:利用递归找到倒数第一个父节点,记录下它的右节点,将左边的移到右边,然后再把之前标记的右节点连接上。
代码
public class Solution { public void flatten(TreeNode root) { if(root==null) return; flatten(root.left); flatten(root.right); TreeNode temp=root.right; if(root.left!=null){ root.right=root.left; root.left=null; while(root.right != null){ root=root.right; } root.right=temp; } }}
代码下载:https://github.com/jimenbian/GarvinLeetCode
/********************************
* 本文来自博客 “李博Garvin“
* 转载请标明出处:http://blog.csdn.net/buptgshengod
******************************************/
0 0
- 【LeetCode从零单排】No 114 Flatten Binary Tree to Linked List
- LeetCode No.114 Flatten Binary Tree to Linked List
- LeetCode: Flatten Binary Tree to Linked List
- LeetCode Flatten Binary Tree to Linked List
- LeetCode: Flatten Binary Tree to Linked List
- [Leetcode] Flatten Binary Tree to Linked List
- [LeetCode] Flatten Binary Tree to Linked List
- Leetcode: Flatten Binary Tree to Linked List
- leetcode Flatten Binary Tree to Linked List
- LeetCode Flatten Binary Tree to Linked List
- LeetCode - Flatten Binary Tree to Linked List
- 【leetcode】Flatten Binary Tree to Linked List
- [LeetCode]Flatten Binary Tree to Linked List
- [Leetcode]Flatten Binary Tree to Linked List
- [leetcode]Flatten Binary Tree to Linked List
- LeetCode-Flatten Binary Tree to Linked List
- [leetcode] Flatten Binary Tree to Linked List
- LeetCode - Flatten Binary Tree to Linked List
- 图像批处理常用命令
- 用Meta工具查看IMEI和IMEISV保存的位置
- 10亿内素数个数及总和
- 去掉标题栏图标
- 贝叶斯
- 【LeetCode从零单排】No 114 Flatten Binary Tree to Linked List
- python 性能分析
- Http常用的请求头含义
- 苹果开发者帐号申请流程
- 黑马程序员---C语言学习笔记之六
- 基于内容的图片检索CBIR(Content Based Image Retrieval)简介
- (1.3.1)各查找和排序等算法一览
- Android实现推送方式解决方案<二>
- 虚拟机Hyper-V安装CentOS6网卡为什么不识别?