serialize-and-deserialize-bst

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Serialization is 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 search tree. There is no restriction on how your serialization/deserialization algorithm should work. You need to ensure that a binary search tree can be serialized to a string, and this string can be deserialized to the original tree structure.

The encoded string should be as compact as possible.

&nbsp;
Example 1:
<pre>Input: root = [2,1,3]
Output: [2,1,3]
</pre>Example 2:
<pre>Input: root = []
Output: []
</pre>
&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[0, 104]</code>.</li>
	<li><code>0 &lt;= Node.val &lt;= 104</code></li>
	<li>The input tree is guaranteed to be a binary search tree.</li>
</ul>

CodecDriver

Serialize and Deserialize BST

Serialize and Deserialize Binary Tree

serialize-and-deserialize-binary-tree

二叉树的序列化与反序列化

Find Duplicate Subtrees

find-duplicate-subtrees

寻找重复的子树

Serialize and Deserialize N-ary Tree

serialize-and-deserialize-n-ary-tree

序列化和反序列化 N 叉树

Tree

Depth-First Search

Breadth-First Search

Design

Binary Search Tree

String

Binary Tree

序列化是将数据结构或对象转换为一系列位的过程，以便它可以存储在文件或内存缓冲区中，或通过网络连接链路传输，以便稍后在同一个或另一个计算机环境中重建。

设计一个算法来序列化和反序列化 二叉搜索树 。 对序列化/反序列化算法的工作方式没有限制。 您只需确保二叉搜索树可以序列化为字符串，并且可以将该字符串反序列化为最初的二叉搜索树。

编码的字符串应尽可能紧凑。

&nbsp;

示例 1：

<pre>
输入：root = [2,1,3]
输出：[2,1,3]
</pre>

示例 2：

<pre>
输入：root = []
输出：[]
</pre>

&nbsp;

提示：

<ul>
	<li>树中节点数范围是 <code>[0, 104]</code></li>
	<li><code>0 &lt;= Node.val &lt;= 104</code></li>
	<li>题目数据 保证 输入的树是一棵二叉搜索树。</li>
</ul>