{"version":3,"sources":["jsdelivr-header.js","/npm/dumb-binary-tree@0.0.3/dist/index.js"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA,ACNA,aACA,OAAO,eAAe,QAAS,aAAc,CAAE,OAAO,IACtD,QAAQ,OAAS,QAAQ,gBAAa,EACtC,IAAI,QAAU,QAAQ,WACtB,QAAQ,WAAa,SAAU,EAAK,EAAM,GACtC,MAAO,CACH,IAAK,EACL,KAAM,EACN,MAAO,EAEf,EACA,QAAQ,OAAS,SAAU,GACvB,GAAqB,IAAjB,EAAM,OAAV,CAMA,IAJA,IAAI,EAAQ,QAAQ,WAAW,EAAM,SAEjC,EAAY,CADL,GAEP,EAAQ,EACL,EAAQ,EAAM,QAAU,EAAI,EAAU,QAAQ,CAEjD,IADA,IAAI,EAAQ,GACL,EAAI,EAAU,QAAQ,CACzB,IAAI,EAAO,EAAU,QACjB,EAAO,EAAM,KACb,EAAQ,EAAM,KACN,MAAR,IACA,EAAK,KAAO,QAAQ,WAAW,GAC/B,EAAM,KAAK,EAAK,OAEP,MAAT,IACA,EAAK,MAAQ,QAAQ,WAAW,GAChC,EAAM,KAAK,EAAK,OAExB,CACA,EAAY,CAChB,CACA,GAAI,EAAQ,EAAM,OACd,MAAM,QAAQ,yBAAyB,EAAM,MAAM,IAEvD,OAAO,CAzBG,CA0Bd","file":"/npm/dumb-binary-tree@0.0.3/dist/index.js","sourceRoot":"","sourcesContent":["/**\n * Minified by jsDelivr using Terser v5.39.0.\n * Original file: /npm/dumb-binary-tree@0.0.3/dist/index.js\n *\n * Do NOT use SRI with dynamically generated files! More information: https://www.jsdelivr.com/using-sri-with-dynamic-files\n */\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.binary = exports.createTree = void 0;\nvar error_1 = require(\"./error\");\nexports.createTree = function (val, left, right) {\n    return {\n        val: val,\n        left: left,\n        right: right,\n    };\n};\nexports.binary = function (input) {\n    if (input.length === 0)\n        return;\n    var dummy = exports.createTree(input.shift());\n    var root = dummy;\n    var baseStack = [root];\n    var index = 0;\n    while (index < input.length && 0 < baseStack.length) {\n        var stack = [];\n        while (0 < baseStack.length) {\n            var node = baseStack.shift();\n            var left = input[index++];\n            var right = input[index++];\n            if (left != null) {\n                node.left = exports.createTree(left);\n                stack.push(node.left);\n            }\n            if (right != null) {\n                node.right = exports.createTree(right);\n                stack.push(node.right);\n            }\n        }\n        baseStack = stack;\n    }\n    if (index < input.length) {\n        throw error_1.createTooManyInputValues(input.slice(index));\n    }\n    return dummy;\n};\n"]}