114. 二叉树展开为链表
给你二叉树的根结点 root ,请你将它展开为一个单链表:
展开后的单链表应该同样使用 TreeNode ,其中 right 子指针指向链表中下一个结点,而左子指针始终为 null 。
展开后的单链表应该与二叉树 先序遍历 顺序相同。
示例 1:
输入:root = [1,2,5,3,4,null,6]
输出:[1,null,2,null,3,null,4,null,5,null,6]
示例 2:
输入:root = []
输出:[]
示例 3:
输入:root = [0]
输出:[0]
思路
1. 题意:将一个普通二叉树转换为没有左子树的二叉树。
2. 方法:
1)按照先序遍历读取二叉树将其存储至一列表中,随后逐个读取并构造无左子树的二叉树。
2)(参考题解)利用递归,每次先存储右子树,将左子树移至右子树位置,并设置左子树为空。最后遍历至新右子树的最末端,附加原右子树。
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public void flatten(TreeNode root) {
List<TreeNode> list = new ArrayList<>();
preOrder(list, root);
int size = list.size();
for (int i = 1; i < size; i++) {
TreeNode prev = list.get(i-1);
TreeNode cur = list.get(i);
prev.left = null;
prev.right = cur;
}
}
public void preOrder(List<TreeNode> list, TreeNode root) {
if (root != null) {
list.add(root);
preOrder(list, root.left);
preOrder(list, root.right);
}
}
}
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public void flatten(TreeNode root) {
if (root == null)
return;
flatten(root.left);
flatten(root.right);
TreeNode temp = root.right;
root.right = root.left;
root.left = null;
while (root.right != null)
root = root.right;
root.right = temp;
}
}
运行结果