forked from AnasImloul/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSerialize and Deserialize BST.js
59 lines (54 loc) · 1.29 KB
/
Serialize and Deserialize BST.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
/**
* 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}
*/
var serialize = function(root) {
if(!root) return "";
let result = "";
function DFS(root) {
result = result ? result + ',' + root.val : result + root.val;
if(root.left) {
DFS(root.left);
}
if(root.right) {
DFS(root.right);
}
}
DFS(root);
return result;
};
/**
* Decodes your encoded data to tree.
*
* @param {string} data
* @return {TreeNode}
*/
var deserialize = function(data) {
if(data === '') return null;
preorder = data.split(',');
let i = 0;
function constructTree(lower, upper) {
if(i === preorder.length) return null;
if(Number(preorder[i]) > upper) return null;
if(Number(preorder[i]) < lower) return null;
let root = new TreeNode(preorder[i]);
i++;
root.left = constructTree(lower, root.val);
root.right = constructTree(root.val, upper);
return root;
}
return constructTree(-Infinity, Infinity);
};
/**
* Your functions will be called as such:
* deserialize(serialize(root));
*/