2022.03.05 - NC027.BM39 序列化二叉树

1. 题目

2. 思路

(1) 前序遍历+中序遍历

• 将二叉树的前序遍历和中序遍历的结果保存成字符串，再从字符串还原出前序遍历和中序遍历的结果，根据结果重建二叉树即可。

3. 代码

import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;

public class Test {
    public static void main(String[] args) {
    }
}

class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }
}

class Solution {
    String Serialize(TreeNode root) {
        List<Integer> list1 = new ArrayList<>();
        List<Integer> list2 = new ArrayList<>();
        Deque<TreeNode> stack1 = new LinkedList<>();
        TreeNode cur = root;
        while (cur != null || !stack1.isEmpty()) {
            while (cur != null) {
                stack1.push(cur);
                list1.add(cur.val);
                cur = cur.left;
            }
            cur = stack1.pop();
            list2.add(cur.val);
            cur = cur.right;
        }
        if (list1.isEmpty()) {
            return "";
        }
        StringBuilder sb = new StringBuilder();
        sb.append(list1.get(0));
        for (int i = 1; i < list1.size(); i++) {
            sb.append(",");
            sb.append(list1.get(i));
        }
        sb.append(" ");
        sb.append(list2.get(0));
        for (int i = 1; i < list2.size(); i++) {
            sb.append(",");
            sb.append(list2.get(i));
        }
        return sb.toString();
    }

    TreeNode Deserialize(String str) {
        if (str.equals("")) {
            return null;
        }
        String[] split = str.split(" ");
        String[] split1 = split[0].split(",");
        String[] split2 = split[1].split(",");
        int n = split1.length;
        int[] arr1 = new int[n];
        int[] arr2 = new int[n];
        for (int i = 0; i < n; i++) {
            arr1[i] = Integer.parseInt(split1[i]);
            arr2[i] = Integer.parseInt(split2[i]);
        }
        return build(arr1, arr2, 0, n - 1, 0, n - 1);
    }

    public TreeNode build(int[] arr1, int[] arr2, int left1, int right1, int left2, int right2) {
        if (left1 > right1) {
            return null;
        }
        TreeNode root = new TreeNode(arr1[left1]);
        int mid = left2;
        for (int i = left2; i <= right2; i++) {
            if (arr2[i] == root.val) {
                mid = i;
                break;
            }
        }
        int leftCount = mid - left2;
        root.left = build(arr1, arr2, left1 + 1, left1 + leftCount, left2, mid - 1);
        root.right = build(arr1, arr2, left1 + leftCount + 1, right1, mid + 1, right2);
        return root;
    }
}