Fix linting errors

mgechev · mgechev · commit 4e9ec58d0aa2 · 2015-01-10T17:31:35.000+02:00
diff --git a/src/data-structures/binary-search-tree.js b/src/data-structures/binary-search-tree.js
@@ -36,25 +36,25 @@
    * @param {Node} right Right sibling.
    * @param {Node} parent Parent of the node.
    */
-  exports.Node = function(value, left, right, parent) {
+  exports.Node = function (value, left, right, parent) {
     /**
      * @member {Number|String}
      */
     this.value = value;
     this._left = left;
     this._right = right;
     this._parent = parent;
-  }
+  };
 
   /**
    * Binary tree.
    *
    * @public
    * @constructor
    */
-  exports.BinaryTree = function() {
+  exports.BinaryTree = function () {
     this._root = null;
-  }
+  };
 
   /**
    * Inserts a node into the binary search tree.<br><br>
@@ -90,7 +90,8 @@
    *
    * @private
    * @param {Node} current Node from which to start the traversal.
-   * @param {Function} callback Callback which will be called for each traversed node.
+   * @param {Function} callback Callback which
+   *    will be called for each traversed node.
    */
   exports.BinaryTree.prototype._inorder = function (current, callback) {
     if (!current) {
@@ -108,7 +109,8 @@
    *
    * @public
    * @method
-   * @param {Function} callback Callback which will be called for each traversed node.
+   * @param {Function} callback Callback which will
+   *   be called for each traversed node.
    */
   exports.BinaryTree.prototype.inorder = function (callback) {
     return this._inorder(this._root, callback);
@@ -119,7 +121,8 @@
    *
    * @private
    * @param {Node} current Node from which to start the traversal.
-   * @param {Function} callback Callback which will be called for each traversed node.
+   * @param {Function} callback Callback which will
+   *   be called for each traversed node
    */
   exports.BinaryTree.prototype._postorder = function (current, callback) {
     if (!current) {
@@ -136,7 +139,8 @@
    * Post-order traversal of the whole tree.
    *
    * @public
-   * @param {Function} callback Callback which will be called for each traversed node.
+   * @param {Function} callback Callback which will
+   *   be called for each traversed node.
    */
   exports.BinaryTree.prototype.postorder = function (callback) {
     return this._postorder(this._root, callback);
@@ -147,7 +151,8 @@
    *
    * @private
    * @param {Node} current Node from which to start the traversal.
-   * @param {Function} callback Callback which will be called for each traversed node.
+   * @param {Function} callback Callback which will
+   *    be called for each traversed node.
    */
   exports.BinaryTree.prototype._preorder = function (current, callback) {
     if (!current) {
@@ -162,9 +167,10 @@
 
   /**
    * Pre-order preorder traversal of the whole tree.
-   * 
+   *
    * @public
-   * @param {Function} callback Callback which will be called for each traversed node.
+   * @param {Function} callback Callback which will be
+   *    called for each traversed node.
    */
   exports.BinaryTree.prototype.preorder = function (callback) {
     return this._preorder(this._root, callback);
@@ -215,7 +221,8 @@
    * @param {Node} oldChild Child to be replaced.
    * @param {Node} newChild Child replacement.
    */
-  exports.BinaryTree.prototype._replaceChild = function (parent, oldChild, newChild) {
+  exports.BinaryTree.prototype._replaceChild =
+   function (parent, oldChild, newChild) {
     if (!parent) {
       this._root = newChild;
       this._root._parent = null;
diff --git a/src/data-structures/heap.js b/src/data-structures/heap.js
@@ -1,13 +1,14 @@
 /**
- * A binary heap is a complete binary tree which satisfies the heap ordering property.
- * 
+ * A binary heap is a complete binary tree which
+ * satisfies the heap ordering property.
+ *
  * @example
  * var Heap = require('path-to-algorithms/src/data-structures/heap').Heap;
- * 
+ *
  * var heap = new Heap(function(a, b) {
  *     return a.birthyear - b.birthyear;
  * });
- * 
+ *
  * heap.add({
  *     name: 'John',
  *     birthyear: 1981
@@ -48,7 +49,7 @@
    * @constructor
    * @param {Function} cmp Function used for comparition between the elements.
    */
-  exports.Heap = function(cmp) {
+  exports.Heap = function (cmp) {
     this._heap = [];
     if (typeof cmp === 'function') {
       this._cmp = cmp;
@@ -57,7 +58,7 @@
         return a - b;
       };
     }
-  }
+  };
 
   /**
    * Exchange indexes with start index given as argument
