题目描述
给你二叉树的根结点 root ,请你将它展开为一个单链表:
展开后的单链表应该同样使用 TreeNode ,其中 right 子指针指向链表中下一个结点,而左子指针始终为 null 。
展开后的单链表应该与二叉树 先序遍历 顺序相同。
题解
/**
* 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 {
Deque<TreeNode> queue = new LinkedList<>();
public void flatten(TreeNode root) {
dfs(root);
TreeNode pre = queue.pollLast();;
while(!queue.isEmpty()) {
pre.left = null;
pre.right = queue.pollLast();
pre = pre.right;
}
return;
}
public void dfs(TreeNode root) {
if(root == null) {
return;
}
queue.offerFirst(root);
dfs(root.left);
dfs(root.right);
}
}