Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 6416cfc

Browse files
committed
update: entry in README
1 parent a75e950 commit 6416cfc

File tree

2 files changed

+3
-0
lines changed
  • src/_DataStructures_/Trees/BinarySearchTree/find-k-nodes-from-root

2 files changed

+3
-0
lines changed

‎README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -42,6 +42,7 @@ Collection of interview questions with Unit Tests. Problems includes Data Struct
4242
- [Find k<sup>th</sup> minimum in a BinarySearchTree](src/_DataStructures_/Trees/BinarySearchTree/find-kth-min)
4343
- [Find Ancestors of a Node](src/_DataStructures_/Trees/BinarySearchTree/find-ancestors)
4444
- [Find Height of BST](src/_DataStructures_/Trees/BinarySearchTree/height-of-bst)
45+
- [Find k Nodes from Root of BST](src/_DataStructures_/Trees/BinarySearchTree/find-k-nodes-from-root)
4546
- [Suffix Tree](src/_DataStructures_/SuffixTree)
4647

4748
### Logical Problems

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

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -29,3 +29,5 @@ function findKNodes(root, k) {
2929
// myBST.add(1);
3030

3131
// console.log(findKNodes(myBST.root, 2));
32+
33+
module.exports = findKNodes;

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /