题解 | #序列化二叉树#

function Serialize(pRoot){
                if(pRoot == null){
                    return '#';
                }
                return pRoot.val + ',' + Serialize(pRoot.left) + ',' + Serialize(pRoot.right);
            }
            function Deserialize(s)
            {
                let arr = s.split(',');
                return DeserializeCore(arr);
            }
            function DeserializeCore(arr){
                let val = arr.shift();
                if(val == '#'){
                    return null;
                }
                let node = new TreeNode(val);
                node.left = DeserializeCore(arr);
                node.right = DeserializeCore(arr);
                return node;
            }
            function TreeNode(x) {
                this.val = x;
                this.left = null;
                this.right = null;
            }