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]
提示:
- 树中结点数在范围
[0, 2000]
内 -100 <= Node.val <= 100
**进阶:**你可以使用原地算法(O(1)
额外空间)展开这棵树吗?
解答:
/**
* 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 {
//栈
//时间复杂度O(N)。空间复杂度O(N)
public void flatten(TreeNode root) {
if(root == null) return;
Stack<TreeNode> stack = new Stack<>();
stack.push(root);
TreeNode pre = null;
while(!stack.isEmpty()){
TreeNode temp = stack.pop();
if(pre != null){
pre.right = temp;
pre.left = null;
}
if(temp.right != null) stack.push(temp.right);
if(temp.left != null) stack.push(temp.left);
pre = temp;
}
}
}
class Solution {
//先序遍历
//时间复杂度O(N)。空间复杂度O(N)
public void flatten(TreeNode root) {
List<TreeNode> list = new ArrayList<>();
preorderTraversal(root, list);
int size = list.size();
for(int i = 1; i < size; i++){
TreeNode prev = list.get(i - 1), curr = list.get(i);
prev.left = null;
prev.right = curr;
}
}
public void preorderTraversal(TreeNode root, List<TreeNode> list){
if(root != null){
list.add(root);
preorderTraversal(root.left, list);
preorderTraversal(root.right, list);
}
}
}
class Solution {
//寻找前驱结点
//时间复杂度O(N)。空间复杂度O(1)
public void flatten(TreeNode root) {
TreeNode curr = root;
while(curr != null){
if(curr.left != null){
TreeNode next = curr.left;
TreeNode predecessor = next;
while(predecessor.right != null){
predecessor = predecessor.right;
}
predecessor.right = curr.right;
curr.left = null;
curr.right = next;
}
curr = curr.right;
}
}
}
参考自:
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list/solution/er-cha-shu-zhan-kai-wei-lian-biao-by-leetcode-solu/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。