0297. Serialize and Deserialize Binary Tree (H)
2021/8/30 23:08:11
本文主要是介绍0297. Serialize and Deserialize Binary Tree (H),对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
Serialize and Deserialize Binary Tree (H)
题目
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.
Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.
Clarification: The input/output format is the same as how LeetCode serializes a binary tree. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.
Example 1:
Input: root = [1,2,3,null,null,4,5] Output: [1,2,3,null,null,4,5]
Example 2:
Input: root = [] Output: []
Example 3:
Input: root = [1] Output: [1]
Example 4:
Input: root = [1,2] Output: [1,2]
Constraints:
- The number of nodes in the tree is in the range
[0, 104]
. -1000 <= Node.val <= 1000
题意
实现二叉树的序列化和反序列化。
思路
按照前序遍历的顺序序列化二叉树,形式为结点的值用分隔符相连。反序列化同样参照前序遍历的顺序,递归处理即可。
代码实现
Java
public class Codec { // Encodes a tree to a single string. public String serialize(TreeNode root) { if (root == null) { return "null"; } String s = "" + root.val; s +="," + serialize(root.left); s += "," + serialize(root.right); return s; } // Decodes your encoded data to tree. public TreeNode deserialize(String data) { String[] arr = data.split(","); Queue<TreeNode> q = new LinkedList<>(); for (int i = 0; i < arr.length; i++) { q.offer(arr[i].equals("null") ? null : new TreeNode(Integer.parseInt(arr[i]))); } return dfs(q); } private TreeNode dfs(Queue<TreeNode> q) { if (q.isEmpty()) { return null; } TreeNode cur = q.poll(); if (cur == null) return null; cur.left = dfs(q); cur.right = dfs(q); return cur; } }
这篇关于0297. Serialize and Deserialize Binary Tree (H)的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-09-28AI给的和自己写的Python代码,都无法改变输入框的内容,替换也不行
- 2024-09-27Sentinel配置限流资料:新手入门教程
- 2024-09-27Sentinel配置限流资料详解
- 2024-09-27Sentinel限流资料:新手入门教程
- 2024-09-26Sentinel限流资料入门详解
- 2024-09-26Springboot框架资料:初学者入门教程
- 2024-09-26Springboot框架资料详解:新手入门教程
- 2024-09-26Springboot企业级开发资料:新手入门指南
- 2024-09-26SpringBoot企业级开发资料新手指南
- 2024-09-26Springboot微服务资料入门教程