update: Find k nodes from the root

Author: ashokdey

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

@@ -0,0 +1,31 @@
+// eslint-disable-next-line no-unused-vars
+const BST = require('../index');
+
+function findKNodes(root, k) {
+  let arr = [];
+
+  if (root === null) return [];
+  if (k === 0) return [...arr, root.value];
+
+  const left = findKNodes(root.leftChild, k - 1);
+  arr = [...arr, ...left];
+
+  const right = findKNodes(root.rightChild, k - 1);
+  arr = [...arr, ...right];
+  return arr;
+}
+
+// create a BST
+// const myBST = new BST(6);
+
+// myBST.add(2);
+// myBST.add(19);
+// myBST.add(14);
+// myBST.add(8);
+// myBST.add(5);
+// myBST.add(12);
+// myBST.add(33);
+// myBST.add(52);
+// myBST.add(1);
+
+// console.log(findKNodes(myBST.root, 2));

src/_DataStructures_/Trees/BinarySearchTree/find-kth-max/index.js

@@ -1,3 +1,4 @@
+// eslint-disable-next-line no-unused-vars
 const BST = require('../index');
 
 // Inorder traversal returns a sorted array

src/_DataStructures_/Trees/BinarySearchTree/find-kth-min/index.js

@@ -34,7 +34,6 @@ function findKthMin(rootNode, k) {
 // myBST.add(1);
 // myBST.add(0);
 
-// // find 3rd max
 // console.log(findKthMin(myBST.root, 3));
 
 module.exports = findKthMin;

src/_DataStructures_/Trees/BinarySearchTree/height-of-bst/index.js

@@ -26,10 +26,8 @@ function findHeightOfBST(root) {
 // myBST.add(12);
 // myBST.add(10);
 
-// // find 3rd max
 // // console.log(myBST.root);
 // console.log(myBST.traversePreorder());
-// // console.log(myBST.root.rightChild);
 // console.log(findHeightOfBST(myBST.root));
 
 module.exports = findHeightOfBST;