序列化二叉树（Java实现）

最新推荐文章于 2022-01-11 15:05:43 发布

原创最新推荐文章于 2022-01-11 15:05:43 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#序列化二叉树 #Java实现

剑指offer（Java实现）专栏收录该内容

61 篇文章

订阅专栏

本文提供了一个关于二叉树序列化与反序列化的解决方案，通过Java代码实现，详细展示了如何将一棵二叉树转换为字符串形式以及如何从字符串中还原成原来的二叉树结构。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

本题为剑指offer面试题62

牛客网测试地址：https://www.nowcoder.com/questionTerminal/cf7e25aa97c04cc1a68c8f040e71fb84

[编程题]序列化二叉树

热度指数：34295时间限制：1秒空间限制：32768K
算法知识视频讲解

请实现两个函数，分别用来序列化和反序列化二叉树

Java code：

package go.jacob.day612;

public class Demo2 {
	/**
	 * 8
	 * 6 10
	 * 5 7 9 11
	 * @param args
	 */
	public static void main(String[] args) {
		TreeNode A = new TreeNode(8);
		TreeNode B = new TreeNode(6);
		TreeNode C = new TreeNode(10);
		TreeNode D = new TreeNode(5);
		TreeNode E = new TreeNode(7);
		TreeNode F = new TreeNode(9);
		TreeNode G = new TreeNode(11);

		A.left = B;
		A.right = C;
		B.left = D;
		B.right = E;
		C.left = F;
		C.right = G;

//		String s = Serialize(A);
//		System.out.println(s);
//		Deserialize(s);
	}

	static StringBuilder sb = null;

	static String Serialize(TreeNode root) {
		if (root == null)
			return "#";
		sb = new StringBuilder();
		Serialize_solve(root);
		String s = sb.toString();
		return s.substring(0, s.length() - 1);
	}

	private static void Serialize_solve(TreeNode root) {
		if (root == null) {
			sb.append("#,");
			return;
		}
		sb.append(root.val + ",");
		Serialize_solve(root.left);
		Serialize_solve(root.right);
	}

	static int index;

	static TreeNode Deserialize(String str) {
		if (str == null || str.trim().equals(""))
			return null;

		String[] strs = str.split(",");
		index = 0;
		return Deserialize_solve(strs);
	}

	private static TreeNode Deserialize_solve(String[] chars) {
		if (chars[index].equals("#")) {
			index++;
			return null;
		}
		System.out.println(chars[index]);
		TreeNode node = new TreeNode(Integer.parseInt(chars[index++]));
		node.left = Deserialize_solve(chars);
		node.right = Deserialize_solve(chars);

		return node;
	}

}

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

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

	}
}