@js-labs/data-structures/lib/ds.js

There are neither a lot of resources on internet nor any book which guides and dictates best practices in the implementation of popular Data Structures using Javascript. The purpose of this library is to provide cooked implementation of populare data stru

(function webpackUniversalModuleDefinition(root, factory) {
	if(typeof exports === 'object' && typeof module === 'object')
		module.exports = factory();
	else if(typeof define === 'function' && define.amd)
		define("ds", [], factory);
	else if(typeof exports === 'object')
		exports["ds"] = factory();
	else
		root["ds"] = factory();
})(typeof self !== 'undefined' ? self : this, function() {
return /******/ (function(modules) { // webpackBootstrap
/******/ 	// The module cache
/******/ 	var installedModules = {};
/******/
/******/ 	// The require function
/******/ 	function __webpack_require__(moduleId) {
/******/
/******/ 		// Check if module is in cache
/******/ 		if(installedModules[moduleId]) {
/******/ 			return installedModules[moduleId].exports;
/******/ 		}
/******/ 		// Create a new module (and put it into the cache)
/******/ 		var module = installedModules[moduleId] = {
/******/ 			i: moduleId,
/******/ 			l: false,
/******/ 			exports: {}
/******/ 		};
/******/
/******/ 		// Execute the module function
/******/ 		modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);
/******/
/******/ 		// Flag the module as loaded
/******/ 		module.l = true;
/******/
/******/ 		// Return the exports of the module
/******/ 		return module.exports;
/******/ 	}
/******/
/******/
/******/ 	// expose the modules object (__webpack_modules__)
/******/ 	__webpack_require__.m = modules;
/******/
/******/ 	// expose the module cache
/******/ 	__webpack_require__.c = installedModules;
/******/
/******/ 	// define getter function for harmony exports
/******/ 	__webpack_require__.d = function(exports, name, getter) {
/******/ 		if(!__webpack_require__.o(exports, name)) {
/******/ 			Object.defineProperty(exports, name, { enumerable: true, get: getter });
/******/ 		}
/******/ 	};
/******/
/******/ 	// define __esModule on exports
/******/ 	__webpack_require__.r = function(exports) {
/******/ 		if(typeof Symbol !== 'undefined' && Symbol.toStringTag) {
/******/ 			Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
/******/ 		}
/******/ 		Object.defineProperty(exports, '__esModule', { value: true });
/******/ 	};
/******/
/******/ 	// create a fake namespace object
/******/ 	// mode & 1: value is a module id, require it
/******/ 	// mode & 2: merge all properties of value into the ns
/******/ 	// mode & 4: return value when already ns object
/******/ 	// mode & 8|1: behave like require
/******/ 	__webpack_require__.t = function(value, mode) {
/******/ 		if(mode & 1) value = __webpack_require__(value);
/******/ 		if(mode & 8) return value;
/******/ 		if((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;
/******/ 		var ns = Object.create(null);
/******/ 		__webpack_require__.r(ns);
/******/ 		Object.defineProperty(ns, 'default', { enumerable: true, value: value });
/******/ 		if(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));
/******/ 		return ns;
/******/ 	};
/******/
/******/ 	// getDefaultExport function for compatibility with non-harmony modules
/******/ 	__webpack_require__.n = function(module) {
/******/ 		var getter = module && module.__esModule ?
/******/ 			function getDefault() { return module['default']; } :
/******/ 			function getModuleExports() { return module; };
/******/ 		__webpack_require__.d(getter, 'a', getter);
/******/ 		return getter;
/******/ 	};
/******/
/******/ 	// Object.prototype.hasOwnProperty.call
/******/ 	__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };
/******/
/******/ 	// __webpack_public_path__
/******/ 	__webpack_require__.p = "";
/******/
/******/
/******/ 	// Load entry module and return exports
/******/ 	return __webpack_require__(__webpack_require__.s = 0);
/******/ })
/************************************************************************/
/******/ ({

/***/ "./node_modules/regenerator-runtime/runtime.js":
/*!*****************************************************!*\
  !*** ./node_modules/regenerator-runtime/runtime.js ***!
  \*****************************************************/
/*! no static exports found */
/***/ (function(module, exports) {

/**
 * Copyright (c) 2014-present, Facebook, Inc.
 *
 * This source code is licensed under the MIT license found in the
 * LICENSE file in the root directory of this source tree.
 */

!(function(global) {
  "use strict";

  var Op = Object.prototype;
  var hasOwn = Op.hasOwnProperty;
  var undefined; // More compressible than void 0.
  var $Symbol = typeof Symbol === "function" ? Symbol : {};
  var iteratorSymbol = $Symbol.iterator || "@@iterator";
  var asyncIteratorSymbol = $Symbol.asyncIterator || "@@asyncIterator";
  var toStringTagSymbol = $Symbol.toStringTag || "@@toStringTag";

  var inModule = typeof module === "object";
  var runtime = global.regeneratorRuntime;
  if (runtime) {
    if (inModule) {
      // If regeneratorRuntime is defined globally and we're in a module,
      // make the exports object identical to regeneratorRuntime.
      module.exports = runtime;
    }
    // Don't bother evaluating the rest of this file if the runtime was
    // already defined globally.
    return;
  }

  // Define the runtime globally (as expected by generated code) as either
  // module.exports (if we're in a module) or a new, empty object.
  runtime = global.regeneratorRuntime = inModule ? module.exports : {};

  function wrap(innerFn, outerFn, self, tryLocsList) {
    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.
    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;
    var generator = Object.create(protoGenerator.prototype);
    var context = new Context(tryLocsList || []);

    // The ._invoke method unifies the implementations of the .next,
    // .throw, and .return methods.
    generator._invoke = makeInvokeMethod(innerFn, self, context);

    return generator;
  }
  runtime.wrap = wrap;

  // Try/catch helper to minimize deoptimizations. Returns a completion
  // record like context.tryEntries[i].completion. This interface could
  // have been (and was previously) designed to take a closure to be
  // invoked without arguments, but in all the cases we care about we
  // already have an existing method we want to call, so there's no need
  // to create a new function object. We can even get away with assuming
  // the method takes exactly one argument, since that happens to be true
  // in every case, so we don't have to touch the arguments object. The
  // only additional allocation required is the completion record, which
  // has a stable shape and so hopefully should be cheap to allocate.
  function tryCatch(fn, obj, arg) {
    try {
      return { type: "normal", arg: fn.call(obj, arg) };
    } catch (err) {
      return { type: "throw", arg: err };
    }
  }

  var GenStateSuspendedStart = "suspendedStart";
  var GenStateSuspendedYield = "suspendedYield";
  var GenStateExecuting = "executing";
  var GenStateCompleted = "completed";

  // Returning this object from the innerFn has the same effect as
  // breaking out of the dispatch switch statement.
  var ContinueSentinel = {};

  // Dummy constructor functions that we use as the .constructor and
  // .constructor.prototype properties for functions that return Generator
  // objects. For full spec compliance, you may wish to configure your
  // minifier not to mangle the names of these two functions.
  function Generator() {}
  function GeneratorFunction() {}
  function GeneratorFunctionPrototype() {}

  // This is a polyfill for %IteratorPrototype% for environments that
  // don't natively support it.
  var IteratorPrototype = {};
  IteratorPrototype[iteratorSymbol] = function () {
    return this;
  };

  var getProto = Object.getPrototypeOf;
  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));
  if (NativeIteratorPrototype &&
      NativeIteratorPrototype !== Op &&
      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {
    // This environment has a native %IteratorPrototype%; use it instead
    // of the polyfill.
    IteratorPrototype = NativeIteratorPrototype;
  }

  var Gp = GeneratorFunctionPrototype.prototype =
    Generator.prototype = Object.create(IteratorPrototype);
  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;
  GeneratorFunctionPrototype.constructor = GeneratorFunction;
  GeneratorFunctionPrototype[toStringTagSymbol] =
    GeneratorFunction.displayName = "GeneratorFunction";

  // Helper for defining the .next, .throw, and .return methods of the
  // Iterator interface in terms of a single ._invoke method.
  function defineIteratorMethods(prototype) {
    ["next", "throw", "return"].forEach(function(method) {
      prototype[method] = function(arg) {
        return this._invoke(method, arg);
      };
    });
  }

  runtime.isGeneratorFunction = function(genFun) {
    var ctor = typeof genFun === "function" && genFun.constructor;
    return ctor
      ? ctor === GeneratorFunction ||
        // For the native GeneratorFunction constructor, the best we can
        // do is to check its .name property.
        (ctor.displayName || ctor.name) === "GeneratorFunction"
      : false;
  };

  runtime.mark = function(genFun) {
    if (Object.setPrototypeOf) {
      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);
    } else {
      genFun.__proto__ = GeneratorFunctionPrototype;
      if (!(toStringTagSymbol in genFun)) {
        genFun[toStringTagSymbol] = "GeneratorFunction";
      }
    }
    genFun.prototype = Object.create(Gp);
    return genFun;
  };

  // Within the body of any async function, `await x` is transformed to
  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test
  // `hasOwn.call(value, "__await")` to determine if the yielded value is
  // meant to be awaited.
  runtime.awrap = function(arg) {
    return { __await: arg };
  };

  function AsyncIterator(generator) {
    function invoke(method, arg, resolve, reject) {
      var record = tryCatch(generator[method], generator, arg);
      if (record.type === "throw") {
        reject(record.arg);
      } else {
        var result = record.arg;
        var value = result.value;
        if (value &&
            typeof value === "object" &&
            hasOwn.call(value, "__await")) {
          return Promise.resolve(value.__await).then(function(value) {
            invoke("next", value, resolve, reject);
          }, function(err) {
            invoke("throw", err, resolve, reject);
          });
        }

        return Promise.resolve(value).then(function(unwrapped) {
          // When a yielded Promise is resolved, its final value becomes
          // the .value of the Promise<{value,done}> result for the
          // current iteration.
          result.value = unwrapped;
          resolve(result);
        }, function(error) {
          // If a rejected Promise was yielded, throw the rejection back
          // into the async generator function so it can be handled there.
          return invoke("throw", error, resolve, reject);
        });
      }
    }

    var previousPromise;

    function enqueue(method, arg) {
      function callInvokeWithMethodAndArg() {
        return new Promise(function(resolve, reject) {
          invoke(method, arg, resolve, reject);
        });
      }

      return previousPromise =
        // If enqueue has been called before, then we want to wait until
        // all previous Promises have been resolved before calling invoke,
        // so that results are always delivered in the correct order. If
        // enqueue has not been called before, then it is important to
        // call invoke immediately, without waiting on a callback to fire,
        // so that the async generator function has the opportunity to do
        // any necessary setup in a predictable way. This predictability
        // is why the Promise constructor synchronously invokes its
        // executor callback, and why async functions synchronously
        // execute code before the first await. Since we implement simple
        // async functions in terms of async generators, it is especially
        // important to get this right, even though it requires care.
        previousPromise ? previousPromise.then(
          callInvokeWithMethodAndArg,
          // Avoid propagating failures to Promises returned by later
          // invocations of the iterator.
          callInvokeWithMethodAndArg
        ) : callInvokeWithMethodAndArg();
    }

    // Define the unified helper method that is used to implement .next,
    // .throw, and .return (see defineIteratorMethods).
    this._invoke = enqueue;
  }

  defineIteratorMethods(AsyncIterator.prototype);
  AsyncIterator.prototype[asyncIteratorSymbol] = function () {
    return this;
  };
  runtime.AsyncIterator = AsyncIterator;

  // Note that simple async functions are implemented on top of
  // AsyncIterator objects; they just return a Promise for the value of
  // the final result produced by the iterator.
  runtime.async = function(innerFn, outerFn, self, tryLocsList) {
    var iter = new AsyncIterator(
      wrap(innerFn, outerFn, self, tryLocsList)
    );

    return runtime.isGeneratorFunction(outerFn)
      ? iter // If outerFn is a generator, return the full iterator.
      : iter.next().then(function(result) {
          return result.done ? result.value : iter.next();
        });
  };

  function makeInvokeMethod(innerFn, self, context) {
    var state = GenStateSuspendedStart;

    return function invoke(method, arg) {
      if (state === GenStateExecuting) {
        throw new Error("Generator is already running");
      }

      if (state === GenStateCompleted) {
        if (method === "throw") {
          throw arg;
        }

        // Be forgiving, per 25.3.3.3.3 of the spec:
        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume
        return doneResult();
      }

      context.method = method;
      context.arg = arg;

      while (true) {
        var delegate = context.delegate;
        if (delegate) {
          var delegateResult = maybeInvokeDelegate(delegate, context);
          if (delegateResult) {
            if (delegateResult === ContinueSentinel) continue;
            return delegateResult;
          }
        }

        if (context.method === "next") {
          // Setting context._sent for legacy support of Babel's
          // function.sent implementation.
          context.sent = context._sent = context.arg;

        } else if (context.method === "throw") {
          if (state === GenStateSuspendedStart) {
            state = GenStateCompleted;
            throw context.arg;
          }

          context.dispatchException(context.arg);

        } else if (context.method === "return") {
          context.abrupt("return", context.arg);
        }

        state = GenStateExecuting;

        var record = tryCatch(innerFn, self, context);
        if (record.type === "normal") {
          // If an exception is thrown from innerFn, we leave state ===
          // GenStateExecuting and loop back for another invocation.
          state = context.done
            ? GenStateCompleted
            : GenStateSuspendedYield;

          if (record.arg === ContinueSentinel) {
            continue;
          }

          return {
            value: record.arg,
            done: context.done
          };

        } else if (record.type === "throw") {
          state = GenStateCompleted;
          // Dispatch the exception by looping back around to the
          // context.dispatchException(context.arg) call above.
          context.method = "throw";
          context.arg = record.arg;
        }
      }
    };
  }

  // Call delegate.iterator[context.method](context.arg) and handle the
  // result, either by returning a { value, done } result from the
  // delegate iterator, or by modifying context.method and context.arg,
  // setting context.delegate to null, and returning the ContinueSentinel.
  function maybeInvokeDelegate(delegate, context) {
    var method = delegate.iterator[context.method];
    if (method === undefined) {
      // A .throw or .return when the delegate iterator has no .throw
      // method always terminates the yield* loop.
      context.delegate = null;

      if (context.method === "throw") {
        if (delegate.iterator.return) {
          // If the delegate iterator has a return method, give it a
          // chance to clean up.
          context.method = "return";
          context.arg = undefined;
          maybeInvokeDelegate(delegate, context);

          if (context.method === "throw") {
            // If maybeInvokeDelegate(context) changed context.method from
            // "return" to "throw", let that override the TypeError below.
            return ContinueSentinel;
          }
        }

        context.method = "throw";
        context.arg = new TypeError(
          "The iterator does not provide a 'throw' method");
      }

      return ContinueSentinel;
    }

    var record = tryCatch(method, delegate.iterator, context.arg);

    if (record.type === "throw") {
      context.method = "throw";
      context.arg = record.arg;
      context.delegate = null;
      return ContinueSentinel;
    }

    var info = record.arg;

    if (! info) {
      context.method = "throw";
      context.arg = new TypeError("iterator result is not an object");
      context.delegate = null;
      return ContinueSentinel;
    }

    if (info.done) {
      // Assign the result of the finished delegate to the temporary
      // variable specified by delegate.resultName (see delegateYield).
      context[delegate.resultName] = info.value;

      // Resume execution at the desired location (see delegateYield).
      context.next = delegate.nextLoc;

      // If context.method was "throw" but the delegate handled the
      // exception, let the outer generator proceed normally. If
      // context.method was "next", forget context.arg since it has been
      // "consumed" by the delegate iterator. If context.method was
      // "return", allow the original .return call to continue in the
      // outer generator.
      if (context.method !== "return") {
        context.method = "next";
        context.arg = undefined;
      }

    } else {
      // Re-yield the result returned by the delegate method.
      return info;
    }

    // The delegate iterator is finished, so forget it and continue with
    // the outer generator.
    context.delegate = null;
    return ContinueSentinel;
  }

  // Define Generator.prototype.{next,throw,return} in terms of the
  // unified ._invoke helper method.
  defineIteratorMethods(Gp);

  Gp[toStringTagSymbol] = "Generator";

  // A Generator should always return itself as the iterator object when the
  // @@iterator function is called on it. Some browsers' implementations of the
  // iterator prototype chain incorrectly implement this, causing the Generator
  // object to not be returned from this call. This ensures that doesn't happen.
  // See https://github.com/facebook/regenerator/issues/274 for more details.
  Gp[iteratorSymbol] = function() {
    return this;
  };

  Gp.toString = function() {
    return "[object Generator]";
  };

  function pushTryEntry(locs) {
    var entry = { tryLoc: locs[0] };

    if (1 in locs) {
      entry.catchLoc = locs[1];
    }

    if (2 in locs) {
      entry.finallyLoc = locs[2];
      entry.afterLoc = locs[3];
    }

    this.tryEntries.push(entry);
  }

  function resetTryEntry(entry) {
    var record = entry.completion || {};
    record.type = "normal";
    delete record.arg;
    entry.completion = record;
  }

  function Context(tryLocsList) {
    // The root entry object (effectively a try statement without a catch
    // or a finally block) gives us a place to store values thrown from
    // locations where there is no enclosing try statement.
    this.tryEntries = [{ tryLoc: "root" }];
    tryLocsList.forEach(pushTryEntry, this);
    this.reset(true);
  }

  runtime.keys = function(object) {
    var keys = [];
    for (var key in object) {
      keys.push(key);
    }
    keys.reverse();

    // Rather than returning an object with a next method, we keep
    // things simple and return the next function itself.
    return function next() {
      while (keys.length) {
        var key = keys.pop();
        if (key in object) {
          next.value = key;
          next.done = false;
          return next;
        }
      }

      // To avoid creating an additional object, we just hang the .value
      // and .done properties off the next function object itself. This
      // also ensures that the minifier will not anonymize the function.
      next.done = true;
      return next;
    };
  };

  function values(iterable) {
    if (iterable) {
      var iteratorMethod = iterable[iteratorSymbol];
      if (iteratorMethod) {
        return iteratorMethod.call(iterable);
      }

      if (typeof iterable.next === "function") {
        return iterable;
      }

      if (!isNaN(iterable.length)) {
        var i = -1, next = function next() {
          while (++i < iterable.length) {
            if (hasOwn.call(iterable, i)) {
              next.value = iterable[i];
              next.done = false;
              return next;
            }
          }

          next.value = undefined;
          next.done = true;

          return next;
        };

        return next.next = next;
      }
    }

    // Return an iterator with no values.
    return { next: doneResult };
  }
  runtime.values = values;

  function doneResult() {
    return { value: undefined, done: true };
  }

  Context.prototype = {
    constructor: Context,

    reset: function(skipTempReset) {
      this.prev = 0;
      this.next = 0;
      // Resetting context._sent for legacy support of Babel's
      // function.sent implementation.
      this.sent = this._sent = undefined;
      this.done = false;
      this.delegate = null;

      this.method = "next";
      this.arg = undefined;

      this.tryEntries.forEach(resetTryEntry);

      if (!skipTempReset) {
        for (var name in this) {
          // Not sure about the optimal order of these conditions:
          if (name.charAt(0) === "t" &&
              hasOwn.call(this, name) &&
              !isNaN(+name.slice(1))) {
            this[name] = undefined;
          }
        }
      }
    },

    stop: function() {
      this.done = true;

      var rootEntry = this.tryEntries[0];
      var rootRecord = rootEntry.completion;
      if (rootRecord.type === "throw") {
        throw rootRecord.arg;
      }

      return this.rval;
    },

    dispatchException: function(exception) {
      if (this.done) {
        throw exception;
      }

      var context = this;
      function handle(loc, caught) {
        record.type = "throw";
        record.arg = exception;
        context.next = loc;

        if (caught) {
          // If the dispatched exception was caught by a catch block,
          // then let that catch block handle the exception normally.
          context.method = "next";
          context.arg = undefined;
        }

        return !! caught;
      }

      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
        var entry = this.tryEntries[i];
        var record = entry.completion;

        if (entry.tryLoc === "root") {
          // Exception thrown outside of any try block that could handle
          // it, so set the completion value of the entire function to
          // throw the exception.
          return handle("end");
        }

        if (entry.tryLoc <= this.prev) {
          var hasCatch = hasOwn.call(entry, "catchLoc");
          var hasFinally = hasOwn.call(entry, "finallyLoc");

          if (hasCatch && hasFinally) {
            if (this.prev < entry.catchLoc) {
              return handle(entry.catchLoc, true);
            } else if (this.prev < entry.finallyLoc) {
              return handle(entry.finallyLoc);
            }

          } else if (hasCatch) {
            if (this.prev < entry.catchLoc) {
              return handle(entry.catchLoc, true);
            }

          } else if (hasFinally) {
            if (this.prev < entry.finallyLoc) {
              return handle(entry.finallyLoc);
            }

          } else {
            throw new Error("try statement without catch or finally");
          }
        }
      }
    },

    abrupt: function(type, arg) {
      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
        var entry = this.tryEntries[i];
        if (entry.tryLoc <= this.prev &&
            hasOwn.call(entry, "finallyLoc") &&
            this.prev < entry.finallyLoc) {
          var finallyEntry = entry;
          break;
        }
      }

      if (finallyEntry &&
          (type === "break" ||
           type === "continue") &&
          finallyEntry.tryLoc <= arg &&
          arg <= finallyEntry.finallyLoc) {
        // Ignore the finally entry if control is not jumping to a
        // location outside the try/catch block.
        finallyEntry = null;
      }

      var record = finallyEntry ? finallyEntry.completion : {};
      record.type = type;
      record.arg = arg;

      if (finallyEntry) {
        this.method = "next";
        this.next = finallyEntry.finallyLoc;
        return ContinueSentinel;
      }

      return this.complete(record);
    },

    complete: function(record, afterLoc) {
      if (record.type === "throw") {
        throw record.arg;
      }

      if (record.type === "break" ||
          record.type === "continue") {
        this.next = record.arg;
      } else if (record.type === "return") {
        this.rval = this.arg = record.arg;
        this.method = "return";
        this.next = "end";
      } else if (record.type === "normal" && afterLoc) {
        this.next = afterLoc;
      }

      return ContinueSentinel;
    },

    finish: function(finallyLoc) {
      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
        var entry = this.tryEntries[i];
        if (entry.finallyLoc === finallyLoc) {
          this.complete(entry.completion, entry.afterLoc);
          resetTryEntry(entry);
          return ContinueSentinel;
        }
      }
    },

    "catch": function(tryLoc) {
      for (var i = this.tryEntries.length - 1; i >= 0; --i) {
        var entry = this.tryEntries[i];
        if (entry.tryLoc === tryLoc) {
          var record = entry.completion;
          if (record.type === "throw") {
            var thrown = record.arg;
            resetTryEntry(entry);
          }
          return thrown;
        }
      }

      // The context.catch method must only be called with a location
      // argument that corresponds to a known catch block.
      throw new Error("illegal catch attempt");
    },

    delegateYield: function(iterable, resultName, nextLoc) {
      this.delegate = {
        iterator: values(iterable),
        resultName: resultName,
        nextLoc: nextLoc
      };

      if (this.method === "next") {
        // Deliberately forget the last sent value so that we don't
        // accidentally pass it on to the delegate.
        this.arg = undefined;
      }

      return ContinueSentinel;
    }
  };
})(
  // In sloppy mode, unbound `this` refers to the global object, fallback to
  // Function constructor if we're in global strict mode. That is sadly a form
  // of indirect eval which violates Content Security Policy.
  (function() {
    return this || (typeof self === "object" && self);
  })() || Function("return this")()
);


/***/ }),

/***/ "./src/binary-search-tree/binary-search-tree.js":
/*!******************************************************!*\
  !*** ./src/binary-search-tree/binary-search-tree.js ***!
  \******************************************************/
/*! no static exports found */
/***/ (function(module, exports, __webpack_require__) {

"use strict";


Object.defineProperty(exports, "__esModule", {
  value: true
});
exports.BST = exports.BSTNode = undefined;

var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();

var _queue = __webpack_require__(/*! ../queue/queue */ "./src/queue/queue.js");

function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }

/**
 * This creates a node
 * @name BSTNode
 * @param key
 * @param left
 * @param right
 * @return BSTNode
 */
var BSTNode = exports.BSTNode = function () {
  function BSTNode(key) {
    var details = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;
    var left = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;
    var right = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : null;

    _classCallCheck(this, BSTNode);

    // the constructor creates the leaf node
    this._key = key;
    this._details = details;
    this._left = left;
    this._right = right;
  }

  /* Getter and Setter for key */


  _createClass(BSTNode, [{
    key: 'key',
    get: function get() {
      return this._key;
    },
    set: function set(key) {
      this._key = key;
    }

    /* Getter and Setter for key */

  }, {
    key: 'details',
    get: function get() {
      return this._details;
    },
    set: function set(details) {
      this._details = details;
    }

    /* Getter and Setter for left sub tree */

  }, {
    key: 'left',
    get: function get() {
      return this._left;
    },
    set: function set(left) {
      this._left = left;
    }

    /* Getter and Setter for right sub tree */

  }, {
    key: 'right',
    get: function get() {
      return this._right;
    },
    set: function set(right) {
      this._right = right;
    }
  }]);

  return BSTNode;
}();

/**
 * Private methods name
 */


var inOrderTraversal = Symbol('inorder');
var preOrderTraversal = Symbol('preorder');
var postOrderTraversal = Symbol('postorder');
var levelOrderTraversal = Symbol('levelorder');

/**
 * Private properties name
 */
var length = Symbol('length');

/**
 * Binary Search Tree
 */

var BST = exports.BST = function () {
  function BST() {
    _classCallCheck(this, BST);

    this.root = null;
    this[length] = 0;
  }

  _createClass(BST, [{
    key: 'insert',


    /**
     * Insert value in the BST
     * @param {*} val
     */
    value: function insert(val) {
      var _this = this;

      var details = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;

      // create a BST node
      var bstNode = new BSTNode(val, details);

      /**
       * @name recurseBST
       * @param {*} node - optional, default value is this.root
       */
      var recurseBST = function recurseBST() {
        var node = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : _this.root;

        if (node.key > val && !node.left) {
          node.left = bstNode;
          _this[length]++;
        } else if (node.key > val) {
          recurseBST(node.left);
        } else if (node.key < val && !node.right) {
          node.right = bstNode;
          _this[length]++;
        } else if (node.key < val) {
          recurseBST(node.right);
        }
      };

      if (!this.root) {
        // if the root is null then assign the created node to the root.
        this.root = bstNode;
        this[length]++;
      } else {
        recurseBST();
      }
    }
  }, {
    key: 'delete',
    value: function _delete(val) {
      if (!this.root) {
        return new Error('BST is empty. Cannot delete from empty BST');
      } else {
        var findNode = this.lookup(val);
        if (findNode.hasVal) {
          // case 1
          // when the node has no children or when its a leaf
          // then simply delete the node
          if (!findNode.currentNode.left && !findNode.currentNode.right) {
            //check if the node is the root node
            if (findNode.parentNode === null) {
              this.root = null;
            } else {
              var direction = findNode.parentNode.key > val ? 'left' : 'right';
              findNode.parentNode[direction] = null;
            }
            this[length]--;
          }
          // case 2
          // when node has just 1 child
          // Simply delete the key and point the parent to the child
          else if (!!findNode.currentNode.left ^ !!findNode.currentNode.right) {
              var parentToCurNodeDir = findNode.parentNode.key > val ? 'left' : 'right';
              var curNodeToChildDir = findNode.currentNode.left ? 'left' : 'right';
              findNode.parentNode[parentToCurNodeDir] = findNode.currentNode[curNodeToChildDir];
              this[length]--;
            }
            // case 3
            // when node has both left and right children
            // Find minimum value in the right subtree of the node containing the key to be deleted.
            // Replace the key to be deleted with the min value.
            // Then delete the min val from the right subtree.
            else if (findNode.currentNode.left && findNode.currentNode.right) {
                // find successor
                var successor = this.findMin(findNode.currentNode.right);
                findNode.currentNode.key = successor.subtree.key;
                successor.parent.left = null;
                this[length]--;
              }
        } else {
          return new Error('Node not found.');
        }
      }
    }

    /**
     * Find minimum node of the given subtree. If subtree is not passed then
     * @param {BST} subtree
     * @returns {BST, BST} returns min node and its parent
     */

  }, {
    key: 'findMin',
    value: function findMin() {
      var subtree = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : this.root;

      var parent = void 0;
      while (subtree.left) {
        parent = subtree;
        subtree = subtree.left;
      }
      return { subtree: subtree, parent: parent };
    }

    /**
     * Looks for a value in the BST.
     * @param {string|number} val
     * @return {object} response
     */

  }, {
    key: 'lookup',
    value: function lookup(val) {
      var _this2 = this;

      var response = { hasVal: false, currentNode: null, parentNode: null };
      var lookRecursively = function lookRecursively() {
        var node = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : _this2.root;
        var parent = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;

        if (node) {
          if (node.key === val) {
            response.hasVal = true;
            response.currentNode = node;
            response.parentNode = parent;
          } else if (node.left && node.key > val) {
            lookRecursively(node.left, node);
          } else if (node.right && node.key < val) {
            lookRecursively(node.right, node);
          }
        }
      };

      lookRecursively();
      return response;
    }

    /**
     * Returns height of the Node
     * @param {BST} node
     * @return {number} height
     */

  }, {
    key: 'height',
    value: function height() {
      var node = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : this.root;

      if (node === null) {
        return -1;
      }

      return Math.max(this.height(node.left), this.height(node.right)) + 1;
    }

    /**
     * Print the values of the BST in specific order
     * @param {string} type - value of type can be inOrder, preOrder, postOrder, levelOrder
     */

  }, {
    key: 'traverse',
    value: function traverse(type) {
      var retVal = void 0;
      switch (type) {
        case 'inOrder':
          retVal = this[inOrderTraversal]();
          break;
        case 'preOrder':
          retVal = this[preOrderTraversal]();
          break;
        case 'postOrder':
          retVal = this[postOrderTraversal]();
          break;
        case 'levelOrder':
          retVal = this[levelOrderTraversal]();
          break;
        default:
          retVal = new Error('Type should be one of inOrder, preOrder, postOrder or levelOrder');
          break;
      }

      return retVal;
    }

    /**
     * Inorder traversal - Left, Root, Right
     * Always returns a sorted array
     */

  }, {
    key: inOrderTraversal,
    value: function value() {
      var subtree = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : this.root;

      var traversalList = [];
      var recurseTraversal = function recurseTraversal(node) {
        if (node) {
          recurseTraversal(node.left);
          traversalList.push(node.key);
          recurseTraversal(node.right);
        }
      };

      recurseTraversal(subtree);
      return traversalList;
    }

    /**
     * Preorder traversal - Root, Left, Right
     */

  }, {
    key: preOrderTraversal,
    value: function value() {
      var subtree = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : this.root;

      var traversalList = [];
      var recurseTraversal = function recurseTraversal(node) {
        if (node) {
          traversalList.push(node.key);
          recurseTraversal(node.left);
          recurseTraversal(node.right);
        }
      };

      recurseTraversal(subtree);
      return traversalList;
    }

    /**
     * Postorder traversal - Left, Right, Root
     */

  }, {
    key: postOrderTraversal,
    value: function value() {
      var subtree = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : this.root;

      var traversalList = [];
      var recurseTraversal = function recurseTraversal(node) {
        if (node) {
          recurseTraversal(node.left);
          recurseTraversal(node.right);
          traversalList.push(node.key);
        }
      };

      recurseTraversal(subtree);
      return traversalList;
    }

    /**
     * Levelorder traversal - BFS
     */

  }, {
    key: levelOrderTraversal,
    value: function value() {
      var bfsTraversalList = [];
      var traversalQueue = new _queue.Queue();

      if (this.root !== null) {
        traversalQueue.enqueue(this.root);
      }

      while (!traversalQueue.isEmpty()) {
        var presentNode = traversalQueue.top();
        if (presentNode.left) {
          traversalQueue.enqueue(presentNode.left);
        }
        if (presentNode.right) {
          traversalQueue.enqueue(presentNode.right);
        }
        bfsTraversalList.push(presentNode.key);

        traversalQueue.dequeue();
      }

      return bfsTraversalList;
    }
  }, {
    key: 'len',
    get: function get() {
      return this[length];
    }
  }]);

  return BST;
}();

/***/ }),

/***/ "./src/graph/adj-list.js":
/*!*******************************!*\
  !*** ./src/graph/adj-list.js ***!
  \*******************************/
/*! no static exports found */
/***/ (function(module, exports, __webpack_require__) {

"use strict";


Object.defineProperty(exports, "__esModule", {
  value: true
});
exports.AdjacencyList = undefined;

var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();

var _binarySearchTree = __webpack_require__(/*! ../binary-search-tree/binary-search-tree */ "./src/binary-search-tree/binary-search-tree.js");

function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }

var AdjacencyList = exports.AdjacencyList = function () {
  function AdjacencyList(isDiGraph) {
    _classCallCheck(this, AdjacencyList);

    this.diGraph = isDiGraph;
    this.vertices = new Map();
  }

  /**
   * It adds node to the map and assign an empty list
   * If the node is already added to the map, then nothing happens
   * @param {string|number} node
   */


  _createClass(AdjacencyList, [{
    key: 'addNode',
    value: function addNode(node) {
      if (!this.vertices.get(node)) {
        this.vertices.set(node, new _binarySearchTree.BST());
      }
    }

    /**
     * It removes the node from the map
     * @param {string|number} node
     */

  }, {
    key: 'removeNode',
    value: function removeNode(node) {
      var _this = this;

      // Remove all the vertices formed by this node
      this.vertices.forEach(function (val, key) {
        _this.removeEdge(key, node);
      });

      // finally remove the node
      this.vertices.delete(node);
    }

    /**
     * It adds an edge from vertex fromVertex to vertex toVertex
     * If the verticies are not present then it first adds the missing vertex
     * If the graph is a diGraph then it will add edge between toVertex and fromVertex
     *
     * @param {string|number} fromVertex
     * @param {string|number} toVertex
     * @param {number} weight
     */

  }, {
    key: 'addEdge',
    value: function addEdge(fromVertex, toVertex, weight) {
      if (!this.vertices.has(fromVertex)) {
        this.addNode(fromVertex);
      }

      if (!this.vertices.has(toVertex)) {
        this.addNode(toVertex);
      }

      this.vertices.get(fromVertex).insert(toVertex, { weight: weight });

      if (!this.diGraph) {
        this.vertices.get(toVertex).insert(fromVertex, { weight: weight });
      }
    }

    /**
     * Remove an edge from start vertex to end vertex
     * @param {string|number} fromVertex
     * @param {string|number} toVertex
     */

  }, {
    key: 'removeEdge',
    value: function removeEdge(fromVertex, toVertex) {
      if (this.vertices.has(fromVertex)) {
        var deleteEdge = this.vertices.get(fromVertex).delete(toVertex);
        if (deleteEdge && deleteEdge.constructor === Error) {
          return new Error('No edge present between ' + fromVertex + ' and ' + toVertex);
        }
      } else {
        return new Error('No edge present between ' + fromVertex + ' and ' + toVertex);
      }

      // if the graph is undirected and id its the first call to the removeEdge method
      // set stopRecursion to true and call removeEdge method again by
      // swapping the parameters.
      if (!this.diGraph && !this.removeEdge.stopRecursion) {
        this.removeEdge.stopRecursion = true;
        this.removeEdge(toVertex, fromVertex);
      } else {
        if (this.removeEdge.stopRecursion) {
          this.removeEdge.stopRecursion = undefined;
        }
      }
    }

    /**
     * It returns the weight of the edge. If the edge is not found then it returns undefined
     * @param {string|number} fromVertex
     * @param {string|number} toVertex
     */

  }, {
    key: 'getEdgeWeight',
    value: function getEdgeWeight(fromVertex, toVertex) {
      var weight = void 0;
      if (this.vertices.has(fromVertex)) {
        var lookup = this.vertices.get(fromVertex).lookup(toVertex);
        weight = lookup.hasVal ? lookup.currentNode.details.weight : void 0;
      }
      return weight ? weight : new Error('Edge not found between ' + fromVertex + ' and ' + toVertex);
    }
  }]);

  return AdjacencyList;
}();

/***/ }),

/***/ "./src/graph/graph.js":
/*!****************************!*\
  !*** ./src/graph/graph.js ***!
  \****************************/
/*! no static exports found */
/***/ (function(module, exports, __webpack_require__) {

"use strict";


Object.defineProperty(exports, "__esModule", {
  value: true
});
exports.Graph = undefined;

var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();

var _adjList = __webpack_require__(/*! ./adj-list */ "./src/graph/adj-list.js");

function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }

var Graph = exports.Graph = function () {
  function Graph(directed) {
    _classCallCheck(this, Graph);

    this.diGraph = directed === 'directed';
  }
  /**
   * Create a presentation of type adjList and returns the created object
   * @param {string} presentationType
   * @returns {AdjacencyList} graph
   * @example
   * ```
   * const graph = new Graph;
   * const adjList = graph.createGraph('adjList');
   * ```
   */


  _createClass(Graph, [{
    key: 'createGraph',
    value: function createGraph(presentationType) {
      var graph = void 0;
      if (presentationType === 'adjList') {
        graph = new _adjList.AdjacencyList(this.diGraph);
      } else {
        return new Error('Graph Type not allowed.');
      }

      graph.type = presentationType;
      return graph;
    }
  }]);

  return Graph;
}();

/***/ }),

/***/ "./src/index.js":
/*!**********************!*\
  !*** ./src/index.js ***!
  \**********************/
/*! no static exports found */
/***/ (function(module, exports, __webpack_require__) {

"use strict";


Object.defineProperty(exports, "__esModule", {
  value: true
});

var _queue = __webpack_require__(/*! ./queue/queue */ "./src/queue/queue.js");

Object.keys(_queue).forEach(function (key) {
  if (key === "default" || key === "__esModule") return;
  Object.defineProperty(exports, key, {
    enumerable: true,
    get: function get() {
      return _queue[key];
    }
  });
});

var _binarySearchTree = __webpack_require__(/*! ./binary-search-tree/binary-search-tree */ "./src/binary-search-tree/binary-search-tree.js");

Object.keys(_binarySearchTree).forEach(function (key) {
  if (key === "default" || key === "__esModule") return;
  Object.defineProperty(exports, key, {
    enumerable: true,
    get: function get() {
      return _binarySearchTree[key];
    }
  });
});

var _graph = __webpack_require__(/*! ./graph/graph */ "./src/graph/graph.js");

Object.keys(_graph).forEach(function (key) {
  if (key === "default" || key === "__esModule") return;
  Object.defineProperty(exports, key, {
    enumerable: true,
    get: function get() {
      return _graph[key];
    }
  });
});

var _adjList = __webpack_require__(/*! ./graph/adj-list */ "./src/graph/adj-list.js");

Object.keys(_adjList).forEach(function (key) {
  if (key === "default" || key === "__esModule") return;
  Object.defineProperty(exports, key, {
    enumerable: true,
    get: function get() {
      return _adjList[key];
    }
  });
});

var _linkedList = __webpack_require__(/*! ./linked-list/linked-list */ "./src/linked-list/linked-list.js");

Object.keys(_linkedList).forEach(function (key) {
  if (key === "default" || key === "__esModule") return;
  Object.defineProperty(exports, key, {
    enumerable: true,
    get: function get() {
      return _linkedList[key];
    }
  });
});

/***/ }),

/***/ "./src/linked-list/linked-list.js":
/*!****************************************!*\
  !*** ./src/linked-list/linked-list.js ***!
  \****************************************/
/*! no static exports found */
/***/ (function(module, exports, __webpack_require__) {

"use strict";


Object.defineProperty(exports, "__esModule", {
  value: true
});

var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();

function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }

var Node = exports.Node = function () {
  function Node(key) {
    var next = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;

    _classCallCheck(this, Node);

    this._key = key;
    this._next = next;
  }

  _createClass(Node, [{
    key: 'key',
    get: function get() {
      return this._key;
    }
  }, {
    key: 'next',
    get: function get() {
      return this._next;
    },
    set: function set(node) {
      this._next = node;
    }
  }]);

  return Node;
}();

var _size = Symbol('size');
var _head = Symbol('head');

var LinkedList = exports.LinkedList = function () {
  function LinkedList() {
    _classCallCheck(this, LinkedList);

    this[_size] = 0;
    this[_head] = null;
  }

  _createClass(LinkedList, [{
    key: Symbo