LeetCode_297

题意以及限制条件

1. 题目：

2. 限制条件：
   

想到的所有可能解法

• Ways_1
  
  0. 时间复杂度——O(n)；空间复杂度——O(n)，n为结点的数量。

对应的代码

• Ways_1

class Codec {

    private static final String spliter = ",";
    private static final String NN = "X";

    // Encodes a tree to a single string.
    public String serialize(TreeNode root) {
        StringBuilder sb = new StringBuilder();
        buildString(root, sb);
        return sb.toString();
    }

    private static void buildString(TreeNode node, StringBuilder sb) {
        if (node == null) {
            sb.append(NN).append(spliter);
        } else {
            sb.append(node.val).append(spliter);
            buildString(node.left, sb);
            buildString(node.right, sb);
        }
    }

    // Decodes your encoded data to tree.
    public TreeNode deserialize(String data) {
        Deque<String> nodes = new ArrayDeque<String>();
        nodes.addAll(Arrays.asList(data.split(spliter)));
        return buildTree(nodes);
    }

    private static TreeNode buildTree(Deque<String> nodes) {
        String value = nodes.remove();
        if (value.equals(NN)) {
            return null;
        } else {
            TreeNode node = new TreeNode(Integer.valueOf(value));
            node.left = buildTree(nodes);
            node.right = buildTree(nodes);
            return node;
        }
    }

}

测试样例