update: entry in README

Author: ashokdey

README.md

@@ -42,6 +42,7 @@ Collection of interview questions with Unit Tests. Problems includes Data Struct
     - [Find k<sup>th</sup> minimum in a BinarySearchTree](src/_DataStructures_/Trees/BinarySearchTree/find-kth-min)
     - [Find Ancestors of a Node](src/_DataStructures_/Trees/BinarySearchTree/find-ancestors)
     - [Find Height of BST](src/_DataStructures_/Trees/BinarySearchTree/height-of-bst)
+    - [Find k Nodes from Root of BST](src/_DataStructures_/Trees/BinarySearchTree/find-k-nodes-from-root)
   - [Suffix Tree](src/_DataStructures_/SuffixTree)
 
 ### Logical Problems

src/_DataStructures_/Trees/BinarySearchTree/find-k-nodes-from-root/index.js

@@ -29,3 +29,5 @@ function findKNodes(root, k) {
 // myBST.add(1);
 
 // console.log(findKNodes(myBST.root, 2));
+
+module.exports = findKNodes;