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.
The number of nodes in the tree is in the range [0, 104].
-1000 <= Node.val <= 1000
Solutions
Solution 1: Level Order Traversal
We can use level order traversal to serialize the binary tree. Starting from the root node, we add the nodes of the binary tree to the queue in the order from top to bottom, from left to right. Then we dequeue the nodes in the queue one by one. If the node is not null, we add its value to the serialized string; otherwise, we add a special character #. Finally, we return the serialized string.
During deserialization, we split the serialized string by the delimiter to get a string array, and then add the elements in the string array to the queue in order. The elements in the queue are the nodes of the binary tree. We dequeue the elements from the queue one by one. If the element is not #, we convert it to an integer and use it as the value of the node, and then add the node to the queue; otherwise, we set it to null. Finally, we return the root node.
The time complexity is $O(n)$, and the space complexity is $O(n)$. Where $n$ is the number of nodes in the binary tree.
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = NoneclassCodec:defserialize(self,root):"""Encodes a tree to a single string. :type root: TreeNode :rtype: str """ifrootisNone:return""q=deque([root])ans=[]whileq:node=q.popleft()ifnode:ans.append(str(node.val))q.append(node.left)q.append(node.right)else:ans.append("#")return",".join(ans)defdeserialize(self,data):"""Decodes your encoded data to tree. :type data: str :rtype: TreeNode """ifnotdata:returnNonevals=data.split(",")root=TreeNode(int(vals[0]))q=deque([root])i=1whileq:node=q.popleft()ifvals[i]!="#":node.left=TreeNode(int(vals[i]))q.append(node.left)i+=1ifvals[i]!="#":node.right=TreeNode(int(vals[i]))q.append(node.right)i+=1returnroot# Your Codec object will be instantiated and called as such:# codec = Codec()# codec.deserialize(codec.serialize(root))
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */publicclassCodec{// Encodes a tree to a single string.publicStringserialize(TreeNoderoot){if(root==null){returnnull;}List<String>ans=newArrayList<>();Deque<TreeNode>q=newLinkedList<>();q.offer(root);while(!q.isEmpty()){TreeNodenode=q.poll();if(node!=null){ans.add(node.val+"");q.offer(node.left);q.offer(node.right);}else{ans.add("#");}}returnString.join(",",ans);}// Decodes your encoded data to tree.publicTreeNodedeserialize(Stringdata){if(data==null){returnnull;}String[]vals=data.split(",");inti=0;TreeNoderoot=newTreeNode(Integer.valueOf(vals[i++]));Deque<TreeNode>q=newArrayDeque<>();q.offer(root);while(!q.isEmpty()){TreeNodenode=q.poll();if(!"#".equals(vals[i])){node.left=newTreeNode(Integer.valueOf(vals[i]));q.offer(node.left);}++i;if(!"#".equals(vals[i])){node.right=newTreeNode(Integer.valueOf(vals[i]));q.offer(node.right);}++i;}returnroot;}}// Your Codec object will be instantiated and called as such:// Codec codec = new Codec();// codec.deserialize(codec.serialize(root));
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */classCodec{public:// Encodes a tree to a single string.stringserialize(TreeNode*root){if(!root){return"";}queue<TreeNode*>q{{root}};stringans;while(!q.empty()){autonode=q.front();q.pop();if(node){ans+=to_string(node->val)+" ";q.push(node->left);q.push(node->right);}else{ans+="# ";}}ans.pop_back();returnans;}// Decodes your encoded data to tree.TreeNode*deserialize(stringdata){if(data==""){returnnullptr;}stringstreamss(data);stringt;ss>>t;TreeNode*root=newTreeNode(stoi(t));queue<TreeNode*>q{{root}};while(!q.empty()){autonode=q.front();q.pop();ss>>t;if(t!="#"){node->left=newTreeNode(stoi(t));q.push(node->left);}ss>>t;if(t!="#"){node->right=newTreeNode(stoi(t));q.push(node->right);}}returnroot;}};// Your Codec object will be instantiated and called as such:// Codec codec;// codec.deserialize(codec.serialize(root));
/** * Definition for a binary tree node. * type TreeNode struct { * Val int * Left *TreeNode * Right *TreeNode * } */typeCodecstruct{}funcConstructor()Codec{returnCodec{}}// Serializes a tree to a single string.func(this*Codec)serialize(root*TreeNode)string{ifroot==nil{return""}q:=[]*TreeNode{root}ans:=[]string{}forlen(q)>0{node:=q[0]q=q[1:]ifnode!=nil{ans=append(ans,strconv.Itoa(node.Val))q=append(q,node.Left)q=append(q,node.Right)}else{ans=append(ans,"#")}}returnstrings.Join(ans,",")}// Deserializes your encoded data to tree.func(this*Codec)deserialize(datastring)*TreeNode{ifdata==""{returnnil}vals:=strings.Split(data,",")v,_:=strconv.Atoi(vals[0])i:=1root:=&TreeNode{Val:v}q:=[]*TreeNode{root}forlen(q)>0{node:=q[0]q=q[1:]ifx,err:=strconv.Atoi(vals[i]);err==nil{node.Left=&TreeNode{Val:x}q=append(q,node.Left)}i++ifx,err:=strconv.Atoi(vals[i]);err==nil{node.Right=&TreeNode{Val:x}q=append(q,node.Right)}i++}returnroot}/** * Your Codec object will be instantiated and called as such: * ser := Constructor(); * deser := Constructor(); * data := ser.serialize(root); * ans := deser.deserialize(data); */
/** * Definition for a binary tree node. * function TreeNode(val) { * this.val = val; * this.left = this.right = null; * } *//** * Encodes a tree to a single string. * * @param {TreeNode} root * @return {string} */varserialize=function(root){if(root===null){returnnull;}constans=[];constq=[root];letindex=0;while(index<q.length){constnode=q[index++];if(node!==null){ans.push(node.val.toString());q.push(node.left);q.push(node.right);}else{ans.push('#');}}returnans.join(',');};/** * Decodes your encoded data to tree. * * @param {string} data * @return {TreeNode} */vardeserialize=function(data){if(data===null){returnnull;}constvals=data.split(',');leti=0;constroot=newTreeNode(parseInt(vals[i++]));constq=[root];letindex=0;while(index<q.length){constnode=q[index++];if(vals[i]!=='#'){node.left=newTreeNode(+vals[i]);q.push(node.left);}i++;if(vals[i]!=='#'){node.right=newTreeNode(+vals[i]);q.push(node.right);}i++;}returnroot;};/** * Your functions will be called as such: * deserialize(serialize(root)); */
/** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNode left; * public TreeNode right; * public TreeNode(int x) { val = x; } * } */publicclassCodec{// Encodes a tree to a single string.publicstringserialize(TreeNoderoot){if(root==null){returnnull;}List<string>ans=newList<string>();Queue<TreeNode>q=newQueue<TreeNode>();q.Enqueue(root);while(q.Count>0){TreeNodenode=q.Dequeue();if(node!=null){ans.Add(node.val.ToString());q.Enqueue(node.left);q.Enqueue(node.right);}else{ans.Add("#");}}returnstring.Join(",",ans);}// Decodes your encoded data to tree.publicTreeNodedeserialize(stringdata){if(data==null){returnnull;}string[]vals=data.Split(',');inti=0;TreeNoderoot=newTreeNode(int.Parse(vals[i++]));Queue<TreeNode>q=newQueue<TreeNode>();q.Enqueue(root);while(q.Count>0){TreeNodenode=q.Dequeue();if(vals[i]!="#"){node.left=newTreeNode(int.Parse(vals[i]));q.Enqueue(node.left);}i++;if(vals[i]!="#"){node.right=newTreeNode(int.Parse(vals[i]));q.Enqueue(node.right);}i++;}returnroot;}}// Your Codec object will be instantiated and called as such:// Codec codec = new Codec();// codec.deserialize(codec.serialize(root));