|
| 1 | +/** |
| 2 | + * Definition for a binary tree node. |
| 3 | + * class TreeNode { |
| 4 | + * val: number |
| 5 | + * left: TreeNode | null |
| 6 | + * right: TreeNode | null |
| 7 | + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { |
| 8 | + * this.val = (val===undefined ? 0 : val) |
| 9 | + * this.left = (left===undefined ? null : left) |
| 10 | + * this.right = (right===undefined ? null : right) |
| 11 | + * } |
| 12 | + * } |
| 13 | + */ |
| 14 | + |
| 15 | +/* |
| 16 | + * Encodes a tree to a single string. |
| 17 | + */ |
| 18 | +function serialize(root: TreeNode | null): string { |
| 19 | + if (!root) return "null"; |
| 20 | + |
| 21 | + let result = "" + root.val; |
| 22 | + |
| 23 | + result += "," + serialize(root.left); |
| 24 | + result += "," + serialize(root.right); |
| 25 | + |
| 26 | + return result; |
| 27 | +} |
| 28 | + |
| 29 | +/* |
| 30 | + * Decodes your encoded data to tree. |
| 31 | + */ |
| 32 | +function deserialize(data: string): TreeNode | null { |
| 33 | + const values = data.split(","); |
| 34 | + let index = 0; |
| 35 | + |
| 36 | + const buildTree = () => { |
| 37 | + const val = values[index]; |
| 38 | + index++; |
| 39 | + |
| 40 | + if (val === "null") return null; |
| 41 | + |
| 42 | + const node = new TreeNode(Number(val)); |
| 43 | + node.left = buildTree(); |
| 44 | + node.right = buildTree(); |
| 45 | + return node; |
| 46 | + }; |
| 47 | + |
| 48 | + return buildTree(); |
| 49 | +} |
| 50 | + |
| 51 | +/** |
| 52 | + * Your functions will be called as such: |
| 53 | + * deserialize(serialize(root)); |
| 54 | + */ |
0 commit comments