题目:
序列化:已知树如果当前节点不是空,则打印“值!”
如果为空,则打印“#!”
反序列化:1!2!#!#!3!#!#!
然后构建成树
比如树
1
2 3
null null null null
则前序 序列化为 1!2!#!#!3!#!#!
代码:
package com.sangfor.tree;public class Node {public int value;public Node left;public Node right;public Node(int value) {this.value = value;}
}
package com.sangfor.tree;import java.util.LinkedList;
import java.util.Queue;public class TreeToString {public static void main(String[] args) {String s = "";Node node1 = new Node(1);