資訊專(zhuān)欄INFORMATION COLUMN
Problem
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.
Example:
You may serialize the following tree:
1
/
2 3
/
4 5
as "[1,2,3,null,null,4,5]"
Clarification: The above 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.
Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.
Solution
public class Codec {
// Encodes a tree to a single string.
public String serialize(TreeNode root) {
if (root == null) return "null";
return root.val + "," + serialize(root.left) + "," + serialize(root.right);
}
// Decodes your encoded data to tree.
public TreeNode deserialize(String data) {
List values = Arrays.asList(data.split(","));
Queue queue = new LinkedList<>(values);
return buildTree(queue);
}
private TreeNode buildTree(Queue values) {
if (values == null || values.size() == 0) return null;
String val = values.poll();
if (val.equals("null")) return null;
TreeNode node = new TreeNode(Integer.valueOf(val));
node.left = buildTree(values);
node.right = buildTree(values);
return node;
}
}
文章版權(quán)歸作者所有，未經(jīng)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。
轉(zhuǎn)載請(qǐng)注明本文地址：http://specialneedsforspecialkids.com/yun/77215.html
摘要：題目大意將二叉樹(shù)序列化，返回序列化的，和反序列化還原。解題思路技巧在于將記錄為便于將來(lái)判斷。的思想將每一層記錄下來(lái)，反序列化時(shí)也按照層級(jí)遍歷的方法依次設(shè)置為上一個(gè)里面的元素的左孩子和右孩子。變種，可以要求輸出一個(gè)，而不是 LeetCode 297. Serialize and Deserialize Binary Tree 題目大意: 將二叉樹(shù)序列化，返回序列化的String，和反序列...
摘要：因此題目中的例子的中序遍歷結(jié)果為。但是，標(biāo)準(zhǔn)的中序遍歷并不能使我們將該結(jié)果反構(gòu)造成一棵樹(shù)，我們丟失了父節(jié)點(diǎn)和子節(jié)點(diǎn)之間的關(guān)系。這里我們也可以明顯的看出來(lái)，中序遍歷需要保存的空值遠(yuǎn)遠(yuǎn)多于廣度優(yōu)先遍歷。 題目要求 Serialization is the process of converting a data structure or object into a sequence of ...
摘要：題目解答用一個(gè)特殊的符號(hào)來(lái)表示的情況這是按先序遍歷來(lái)存到中去這里用為其包含了幾乎所有這里還是挺多知識(shí)點(diǎn)的，后是一個(gè)可以把數(shù)組變成則是把加到這個(gè)的中去 題目：Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stor...
摘要：思路理論上說(shuō)所有遍歷的方法都可以。但是為了使和的過(guò)程都盡量最簡(jiǎn)單，是不錯(cuò)的選擇。用作為分隔符，來(lái)表示。復(fù)雜度代碼思路這道題和之前不同，一般的樹(shù)變成了，而且要求是。還是可以用，還是需要分隔符，但是就不需要保存了。 297. Serialize and Deserialize Binary Tree Serialization is the process of converting a...
摘要：題目要求將二叉搜索樹(shù)序列化和反序列化，序列化是指將樹(shù)用字符串的形式表示，反序列化是指將字符串形式的樹(shù)還原成原來(lái)的樣子。假如二叉搜索樹(shù)的節(jié)點(diǎn)較多，該算法將會(huì)占用大量的額外空間。 題目要求 Serialization is the process of converting a data structure or object into a sequence of bits so that...
閱讀 3081·2021-11-24 10:47
閱讀 3831·2021-11-02 14:43
閱讀 2228·2021-09-26 10:15
閱讀 2254·2021-09-08 09:35
閱讀 560·2019-08-30 12:45
閱讀 2781·2019-08-29 17:04
閱讀 3214·2019-08-26 14:05
閱讀 1259·2019-08-26 12:10
