zoukankan      html  css  js  c++  java
  • [Algorithm] Serialize and Deserialize Binary Tree

    Given the root to a binary tree, implement serialize(root), which serializes the tree into a string, and deserialize(s), which deserializes the string back into the tree.

    For example, given the following Node class

    class Node:
        def __init__(self, val, left=None, right=None):
            self.val = val
            self.left = left
            self.right = right
    

    The following test should pass:

    node = Node('root', Node('left', Node('left.left')), Node('right'))
    assert deserialize(serialize(node)).left.left.val == 'left.left'

    Define createNode function:

    function createNode(val, left = null, right = null) {
      return {
        val,
        left,
        addLeft(leftKey) {
          return this.left = leftKey ? createNode(leftKey) : null;
        },
        right,
        addRight(rightKey) {
          return this.right = rightKey ? createNode(rightKey) : null;
        }
      };
    }

    Define a binary tree:

    function createBT(rootKey) {
      const root = createNode(rootKey);
      return {
        root,
        nodes: [],
        serialize(node) {
    
        },
        deserialize(str) {
    
        }
      };
    }

    Construct the tree:

    const tree = createBT("root");
    const root = tree.root;
    const left = root.addLeft("left");
    root.addRight("right");
    left.addLeft("left.left");
    left.addRight("left.right");

    Serialize the tree:

    The idea to serialize a tree is using recsurice apporach, keep calling serialize function for the left side node, then keep calling serialize function for right side nodes.

    In the end, we output the serialized nodes in string format.

        serialize(node) {
          if (node) {
            this.nodes.push(node.val);
            this.serialize(node.left);
            this.serialize(node.right);
          } else {
            this.nodes.push("#");
          }
          return this.nodes.join(" ");
        },
    const ser = tree.serialize(root); // root left left.left # # # right # #

    Deserialize tree:

    By given the serialized tree, every time we calling recsurice, we are trying to create Node, then append its left and right node.

        deserialize(str) {
          
          function* getVals() {
            for (let val of str.split(" ")) {
              yield val;
            }
          }
          
          const helper = (pointer) => {
            let { value , done } = pointer.next();
            if (value === "#" || done) return null;
    
            let node = createNode(value);
            node.left = helper(pointer);
            node.right = helper(pointer);
            return node;
          };
          return helper(getVals());
        }
    const dec = tree.deserialize(ser).left.left.val; // left.left

    -----

    function createNode(val, left = null, right = null) {
      return {
        val,
        left,
        addLeft(leftKey) {
          return this.left = leftKey ? createNode(leftKey) : null;
        },
        right,
        addRight(rightKey) {
          return this.right = rightKey ? createNode(rightKey) : null;
        }
      };
    }
    
    function createBT(rootKey) {
      const root = createNode(rootKey);
      return {
        root,
        nodes: [],
        serialize(node) {
          if (node) {
            this.nodes.push(node.val);
            this.serialize(node.left);
            this.serialize(node.right);
          } else {
            this.nodes.push("#");
          }
          return this.nodes.join(" ");
        },
        deserialize(str) {
          
          function* getVals() {
            for (let val of str.split(" ")) {
              yield val;
            }
          }
          
          const helper = (pointer) => {
            let { value , done } = pointer.next();
            if (value === "#" || done) return null;
    
            let node = createNode(value);
            node.left = helper(pointer);
            node.right = helper(pointer);
            return node;
          };
          return helper(getVals());
        }
      };
    }
    ////////Construct the tree///////////
    const tree = createBT("root");
    const root = tree.root;
    const left = root.addLeft("left");
    root.addRight("right");
    left.addLeft("left.left");
    left.addRight("left.right");
    
    ///////////Serialize and deserialize//////////////
    const ser = tree.serialize(root); // root left left.left # # # right # #
    const dec = tree.deserialize(ser).left.left.val; // left.left
    console.log(ser, dec)
  • 相关阅读:
    SqlServer 2008 R2定时备份数据库,并且发送邮件通知
    C# ICSharpCode.SharpZipLib.dll文件压缩和解压功能类整理,上传文件或下载文件很常用
    C#按回车Enter使输入焦点自动跳到下一个TextBox的方法收集
    SqlServer知识点记录分享
    C#为工作Sql而产生的字符串分割小工具(很实用,你值得拥有)
    SqlServer一张表数据导入另一张表,收藏使用,工作中更新数据错误很有用
    C#根据CPU+磁盘标号来注册软件
    C# winform调用浏览器打开页面方法分享,希望对大家有帮助
    H5 audio标签
    H5 video标签的第二种格式
  • 原文地址:https://www.cnblogs.com/Answer1215/p/10487181.html
Copyright © 2011-2022 走看看