首页 > 代码库 > [leetcode] Flatten Binary Tree to Linked List
[leetcode] Flatten Binary Tree to Linked List
Given a binary tree, flatten it to a linked list in-place.
For example,
Given
1 / 2 5 / \ 3 4 6
The flattened tree should look like:
1 2 3 4 5 6
If you notice carefully in the flattened tree, each node‘s right child points to the next node of a pre-order traversal.
https://oj.leetcode.com/problems/flatten-binary-tree-to-linked-list/
题目要求按照前序遍历转换成一个链表。
思路：先递归实现左右子树，然后调整指针连接起来。
public class Solution { public void flatten(TreeNode root) { if (root == null) return; flatten(root.left); flatten(root.right); TreeNode p = root; if (p.left == null) return; else p = p.left; while (p.right != null) p = p.right; p.right = root.right; root.right = root.left; root.left = null; } public static void main(String[] args) { TreeNode root = new TreeNode(1); root.left = new TreeNode(2); root.left.left = new TreeNode(3); root.left.right = new TreeNode(4); root.right = new TreeNode(5); root.right.right = new TreeNode(6); new Solution().flatten(root); ; }}
参考：
http://blog.csdn.net/havenoidea/article/details/11822019
http://www.cnblogs.com/feiling/p/3278639.html
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。