update: rename folder and fix condition for K

Author: ashokdey

src/_DataStructures_/Trees/BST/Node.js …ructures_/Trees/BinarySearchTree/Node.jssrc/_DataStructures_/Trees/BST/Node.js renamed to src/_DataStructures_/Trees/BinarySearchTree/Node.js src/_DataStructures_/Trees/BST/Node.js renamed to src/_DataStructures_/Trees/BinarySearchTree/Node.js

@@ -13,7 +13,7 @@ function inOrderTraversal(root) {
 
 function findKthMax(rootNode, k) {
   const arr = inOrderTraversal(rootNode);
-  if (k < 0 || k > arr.lenth) {
+  if (k <= 0 || k > arr.lenth) {
     throw new Error('Invalid value for K');
   }
   return arr[arr.length - k];

…uctures_/Trees/BST/find-kth-max/index.js …s/BinarySearchTree/find-kth-max/index.jssrc/_DataStructures_/Trees/BST/find-kth-max/index.js renamed to src/_DataStructures_/Trees/BinarySearchTree/find-kth-max/index.js src/_DataStructures_/Trees/BST/find-kth-max/index.js renamed to src/_DataStructures_/Trees/BinarySearchTree/find-kth-max/index.js

@@ -14,7 +14,7 @@ function inOrderTraversal(root) {
 
 function findKthMin(rootNode, k) {
   const arr = inOrderTraversal(rootNode);
-  if (k < 0 || k > arr.lenth) {
+  if (k <= 0 || k > arr.lenth) {
     throw new Error('Invalid value for K');
   }
   return arr[k - 1];