297. Serialize and Deserialize Binary Tree

Author: Tushar Borole

.idea/workspace.xml

@@ -95,6 +95,7 @@
 | 36   | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)                                                                                 | [Itterative](valid_sudoku.js)                                                                                 | 68 ms            | 37.7 MB              | Medium     | O(1)            | O(1)             | [:link:](https://leetcode.com/problems/valid-sudoku/solution/)    |
 | 146  | [ LRU Cache](https://leetcode.com/problems/lru-cache/)                                                                                      | [Map](lru_cache.js)                                                                                           | 216 ms           | 58.8 MB              | Medium     | O(1)            | O(1)             |                                                                   |
 | 340  | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/) | [Sliding Window Approach](k_distinct_characters.js)                                                           | 68 ms            | 37.1 MB              | Hard       | NlogN           |                  | [:link:](https://www.youtube.com/watch?v=MK-NZ4hN7rs&t=1936s)     |
+| 297  | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)                               | [DFS Recursion](serialize_and_deserialize_binary_tree.js)                                                     | 80 ms            | 43.6 MB              | Hard       |                 |                  | [:link:](https://www.youtube.com/watch?v=suj1ro8TIVY)             |
 
 ## Others
 

README.md

@@ -0,0 +1,54 @@
+// https://www.youtube.com/watch?v=YGZuDSs8fQo
+
+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 === null) {
+    return "null,";
+  }
+  let leftString = serialize(root.left);
+  let rightString = serialize(root.right);
+  return root.val + "," + leftString + rightString;
+  serialize(root);
+};
+
+/**
+ * Decodes your encoded data to tree.
+ *
+ * @param {string} data
+ * @return {TreeNode}
+ */
+var deserialize = function(data) {
+  const list = data.split(",");
+  let recur = function(list) {
+    let val = list.shift();
+    if (val === "null") return null;
+    let newNode = new TreeNode(parseInt(val));
+    newNode.left = recur(list);
+    newNode.right = recur(list);
+    return newNode;
+  };
+  return recur(list);
+};
+
+/**
+ * Your functions will be called as such:
+ * deserialize(serialize(root));
+ */
+
+let root = new TreeNode(1);
+root.left = new TreeNode(2);
+root.right = new TreeNode(3);
+root.right.left = new TreeNode(4);
+root.right.right = new TreeNode(5);
+
+deserialize(serialize(root)); //?