Flatten Binary Tree to Linked List 将二叉树转成链表形式
来源:互联网 发布:淘宝博库图书专营店 编辑:程序博客网 时间:2024/06/05 09:05
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
题目是要让我们将二叉树的节点都放到同一直线上,形成链表一样的。
链表的顺序正是树中序遍历的顺序。
递归思路是这样的:
1. 将左子树部分拉成一条线
2. 将右子树部分拉成一条线。
3. 将root 与左右子树形成的线拼接起来。
运行时间:
代码:
public class FlattenBinaryTreetoLinkedList { public void flatten(TreeNode root) { if (root == null) { return; } TreeNode left = root.left; TreeNode right = root.right; root.left = null; flatten(left); flatten(right); root.right = left; TreeNode cur = root; // go to the last node of flattened left. while (cur.right != null) { cur = cur.right; } cur.right = right; }}
1 0
- Flatten Binary Tree to Linked List 将二叉树转成链表形式
- Flatten Binary Tree to Linked List 将二叉树转换为链表
- Flatten Binary Tree to Linked List 将二叉树转为链表
- 将二叉树拆成链表 Flatten Binary Tree to Linked List
- leetcode 114.Flatten Binary Tree to Linked List (将二叉树转换链表) 解题思路和方法
- Flatten Binary Tree to Linked List 二叉树变成链表@LeetCode,
- LintCode(Flatten Binary Tree to Linked List)翻转二叉树为链表 的变体
- Flatten Binary Tree to Linked List 二叉树拉伸成链表
- Flatten Binary Tree to Linked List:二叉树变更结构
- 树的操作-将树变为链表(Flatten Binary Tree to Linked List)
- [LeetCode] Flatten Binary Tree to Linked List 将二叉树展开成链表 C++
- LeetCode Flatten Binary Tree to Linked List 将二叉树展开成链表
- Flatten Binary Tree to Linked List (二叉树转前序链表)【leetcode】
- 【leetcode 二叉树摊直】Flatten Binary Tree to Linked List
- 453.Flatten Binary Tree to Linked List-将二叉树拆成链表(容易题)
- 二叉查找树的个数,BT search 1, 二叉树遍历的非递归形式,Flatten Binary Tree to Linked List
- 把树变成链表 Flatten Binary Tree to Linked List
- 把二叉树精简成单链表 Flatten Binary Tree to Linked List
- 20款最佳用户体验的Sublime Text 2/3主题下载及安装方法
- UVa 11549
- JsonObject Integer 0
- 深入java虚拟机(九)--常见问题总结
- UVa 11729
- Flatten Binary Tree to Linked List 将二叉树转成链表形式
- maven项目打包资源文件
- Android:DisplayMetrics用法
- UVa 11636
- OpenCV下利用傅里叶变换和逆变换实现图像卷积算法,并附自己对于卷积核/模板核算子的理解!
- centos安装软件方法
- mysql 创建database
- windows 进程间通讯
- MySQL Error Code: 1175