adding fix #1342 fixing docs for FenWickTree and DepthFirstSearch

Author: mohmmadAyesh

Trees/DepthFirstSearch.js

@@ -4,7 +4,12 @@
  * DFS Algorithm for traversing or searching graph data structures.
  */
 
-// traverses a give tree from specified root's value
+/**
+ * Traverses a given tree using Depth-First Search (DFS) algorithm from the specified root's value.
+ * @param {Array} tree The tree data structure represented as an array of nodes.
+ * @param {number} rootValue The value of the root node from which traversal starts.
+ * @returns {Array} An array containing the values of nodes traversed in DFS order.
+ */
 function traverseDFS(tree, rootValue) {
   const stack = []
   const res = []
@@ -23,7 +28,12 @@ function traverseDFS(tree, rootValue) {
   }
   return res.reverse()
 }
-
+/**
+ * Searches for a node with the specified value in the given tree using Depth-First Search (DFS) algorithm.
+ * @param {Array} tree The tree data structure represented as an array of nodes.
+ * @param {number} value The value to search for in the tree nodes.
+ * @returns {Object|null} The node object if found, or null if the value is not found in the tree.
+ */
 function searchDFS(tree, value) {
   const stack = []
   stack.push(tree[0])

Trees/FenwickTree.js

@@ -5,32 +5,45 @@
  */
 
 class FenwickTree {
-  constructor(feneickArray, array, n) {
-    for (let i = 1; i <= n; i++) {
-      feneickArray[i] = 0
-    }
-    for (let i = 0; i < n; i++) {
-      this.update(feneickArray, n, i, array[i])
-    }
-  }
+  /**
+  * Constructs a Fenwick Tree.
+  * @param {Array} fenwickArray The Fenwick Tree array to be initialized.
+  * @param {Array} array The input array whose prefix sum is to be calculated.
+  * @param {number} n The size of the input array.
+  */
+ constructor(feneickArray, array, n) {
+   for (let i = 1; i <= n; i++) {
+     feneickArray[i] = 0
+   }
+   for (let i = 0; i < n; i++) {
+     this.update(feneickArray, n, i, array[i])
+   }
+ }
 
-  update(feneickArray, n, index, value) {
-    index = index + 1
-    while (index <= n) {
-      feneickArray[index] += value
-      index += index & -index
-    }
-  }
+  /**
+  * Updates the Fenwick Tree with a new value at the specified index.
+  * @param {Array} fenwickArray The Fenwick Tree array.
+  * @param {number} n The size of the Fenwick Tree array.
+  * @param {number} index The index at which the value is updated.
+  * @param {number} value The new value to be added at the index.
+  */
+ update(feneickArray, n, index, value) {
+   index = index + 1
+   while (index <= n) {
+     feneickArray[index] += value
+     index += index & -index
+   }
+ }
 
-  getPrefixSum(feneickArray, index) {
-    let currSum = 0
-    index = index + 1
-    while (index > 0) {
-      currSum += feneickArray[index]
-      index -= index & -index
-    }
+ getPrefixSum(feneickArray, index) {
+   let currSum = 0
+   index = index + 1
+   while (index > 0) {
+     currSum += feneickArray[index]
+     index -= index & -index
+   }
 
-    return currSum
-  }
+   return currSum
+ }
 }
 export { FenwickTree }