[LeetCode 中等 二叉树]114. 二叉树展开为链表

题目描述

给定一个二叉树，原地将它展开为一个单链表。

例如，给定二叉树

   1
  / \
 2   5
/ \   \
3   4   6
将其展开为：

1
\
 2
  \
   3
    \
     4
      \
       5
        \
         6

先获得链表顺序再生成链表 先遍历再展开

/**
 * 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){
            List<Integer> nodes = new ArrayList<>();
            // 构建节点值的数组
            getNodes(root,nodes);
            root.left = null;
            root.right = null;
            TreeNode curr = root;

            for(int i=1;i<nodes.size();i++){
                curr.right = new TreeNode(nodes.get(i)); ;
                curr.left=null;
                curr = curr.right;
            }
        }
    }

    public void getNodes(TreeNode root, List<Integer> nodes){
        Stack<TreeNode> stack = new Stack<>();
        TreeNode curr = root;
        while(curr != null || !stack.isEmpty()){
            while(curr!= null){
                nodes.add(curr.val);
                stack.push(curr);
                curr = curr.left;
            }
            curr = stack.pop();
            if(curr.right == null){
                curr = null;
            }else{
                curr = curr.right;
            }
        }
    }
 
}

一边获得链表顺序一边生成链表 一边遍历一边展开

class Solution {
    public void flatten(TreeNode root) {
        if (root == null) {
            return;
        }

        Deque<TreeNode> stack =new LinkedList<>();
        stack.push(root);
        TreeNode prev = null;
        while(!stack.isEmpty()){
            TreeNode curr = stack.pop();
            if(prev != null){
                prev.left = null;
                prev.right= curr;
            }
            if(curr.right!=null) stack.push(curr.right);
            if(curr.left!=null) stack.push(curr.left);
            prev = curr;
        }
    }
}

将右子树全部放在左子树的最右节点后面 再把左子树全放到右边去

class Solution {
    public void flatten(TreeNode root) {
        TreeNode curr = root;
        while(curr != null){
            if(curr.left != null){
                TreeNode afterRoot = curr.left;
                TreeNode predecessor = afterRoot;
                while(predecessor.right != null){
                    predecessor = predecessor.right;
                }
                predecessor.right = curr.right;
                curr.left = null;
                curr.right = afterRoot;
            }
            curr = curr.right;

        }
    }
}