Update docs

Author: mgechev

src/data-structures/binary-search-tree.js

@@ -39,7 +39,7 @@
    *
    * @public
    * @param {Number|String} Value
-   * @param {[Node]} Current node
+   * @param {Node} Current node
    */
   BinaryTree.prototype.insert = function (value, current) {
     if (this._root === null) {
@@ -227,7 +227,7 @@
    *
    * @private
    * @param {Node} Root of the sub-tree
-   * @param {[Number|String]} Current minimum value of the sub-tree
+   * @param {Number|String} Current minimum value of the sub-tree
    * @returns {Node} The node with minimum value in the sub-tree
    */
   BinaryTree.prototype._findMin = function (node, current) {
@@ -244,7 +244,7 @@
    *
    * @private
    * @param {Node} Root of the sub-tree
-   * @param {[Number|String]} Current maximum value of the sub-tree
+   * @param {Number|String} Current maximum value of the sub-tree
    * @returns {Node} The node with maximum value in the sub-tree
    */
   BinaryTree.prototype._findMax = function (node, current) {

src/graphs/searching/bfs.js

@@ -13,14 +13,30 @@
     }
 
     /**
-     * Returns the shortest path between
-     * startNode and targetNode.
-     * Time complexity O(|V|*|V|), because we use adjust matrix.
+     * Breath-First graph searching algorithm.
+     * Returns the shortest path between startNode and targetNode.
+     * Time complexity O(|V|*|V|).
      *
+     * @module graphs/searching
+     * @public
      * @param {array} graph The adjust matrix, which represents the graph
      * @param {number} startNode The start node
      * @param {number} targetNode The target, which should be reached
+     * @param {Array} graph Adjacency matrix, which represents the graph.
      * @returns {array} The shortest path from startNode to targetNode
+     * @param {Number} startNode Start node.
+     * @param {Number} targetNode Target, which should be reached.
+     * @returns {Array} Shortest path from startNode to targetNode.
+     *
+     * @example
+     * var bfs = require('path-to-algorithms/src/graphs/searching/bfs').bfs;
+     * var graph = [[1, 1, 0, 0, 1, 0],
+     *              [1, 0, 1, 0, 1, 0],
+     *              [0, 1, 0, 1, 0, 0],
+     *              [0, 0, 1, 0, 1, 1],
+     *              [1, 1, 0, 1, 0, 0],
+     *              [0, 0, 0, 1, 0, 0]];
+     * var shortestPath = bfs(graph, 1, 5); // [1, 2, 3, 5]
      */
     return function (graph, startNode, targetNode) {
       var parents = [],