-
Notifications
You must be signed in to change notification settings - Fork 269
3 New Problems on BST #63
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Changes from all commits
Commits
Show all changes
19 commits
Select commit
Hold shift + click to select a range
05184c4
update: find k-th max in BST
ashokdey 4a75147
update: entry in readme
ashokdey 93af26e
Merge branch 'master' of github.com:knaxus/problem-solving-javascript...
ashokdey f376135
fix: closing of `<sup>`
ashokdey 0ff8d47
fix: typo error
ashokdey 0bf9860
update: find kth min & throw error for invalid K
ashokdey 4980e96
Merge branch 'problems' of github.com:knaxus/problem-solving-javascri...
ashokdey ca93db3
update: entry in README & folder rename
ashokdey b4507f1
update: rename folder and fix condition for K
ashokdey ab8b038
update: fix entries in readme
ashokdey 81c88b8
update: find all ancestors of a node
ashokdey 252e912
update: entry in README
ashokdey c9e3a6a
update: reverse order of pushing nodes
ashokdey c4a733a
update: height of BST
ashokdey c95821c
update: entry in README
ashokdey a75e950
update: Find k nodes from the root
ashokdey 6416cfc
update: entry in README
ashokdey 97f8f94
fix: change in code, return null when node not found
ashokdey 28e73b5
update: fix the edge case using array approach
ashokdey File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
File renamed without changes.
49 changes: 49 additions & 0 deletions
src/_DataStructures_/Trees/BinarySearchTree/find-ancestors/index.js
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,49 @@ | ||
| // eslint-disable-next-line no-unused-vars | ||
| const BST = require('../index'); | ||
|
|
||
| /** You should go through this conversation here: | ||
| * https://github.com/knaxus/problem-solving-javascript/pull/63 | ||
| */ | ||
|
|
||
| function findAncestors(root, value) { | ||
| /** | ||
| * search the given node and meanwhile | ||
| * keep pushing the visited nodes | ||
| */ | ||
| if (root === null) return false; | ||
|
|
||
| if (value < root.value) { | ||
| const left = findAncestors(root.leftChild, value); | ||
| if (left) { | ||
| return [...left, root.value]; | ||
| } | ||
| return false; | ||
| } | ||
|
|
||
| if (value > root.value) { | ||
| const right = findAncestors(root.rightChild, value); | ||
| if (right) { | ||
| return [...right, root.value]; | ||
| } | ||
| return false; | ||
| } | ||
|
|
||
| if (value === root.value) return []; | ||
| return false; | ||
| } | ||
|
|
||
| // create a BST | ||
| // const myBST = new BST(6); | ||
| // myBST.add(4); | ||
| // myBST.add(9); | ||
| // myBST.add(2); | ||
| // myBST.add(5); | ||
| // myBST.add(14); | ||
| // myBST.add(8); | ||
| // myBST.add(12); | ||
| // myBST.add(10); | ||
|
|
||
| // console.log(findAncestors(myBST.root, 10)); | ||
| // console.log(findAncestors(myBST.root, 101)); | ||
|
|
||
| module.exports = findAncestors; |
33 changes: 33 additions & 0 deletions
src/_DataStructures_/Trees/BinarySearchTree/find-k-nodes-from-root/index.js
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,33 @@ | ||
| // 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)); | ||
|
|
||
| module.exports = findKNodes; |
39 changes: 39 additions & 0 deletions
src/_DataStructures_/Trees/BinarySearchTree/find-kth-max/index.js
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,39 @@ | ||
| // eslint-disable-next-line no-unused-vars | ||
| const BST = require('../index'); | ||
|
|
||
| // Inorder traversal returns a sorted array | ||
| function inOrderTraversal(root) { | ||
| if (root === null) return []; | ||
| let arr = []; | ||
| // traverse left | ||
| const left = inOrderTraversal(root.leftChild); | ||
| arr = [...left, root.value]; | ||
| const right = inOrderTraversal(root.rightChild); | ||
| return [...arr, ...right]; | ||
| } | ||
|
|
||
| function findKthMax(rootNode, k) { | ||
| const arr = inOrderTraversal(rootNode); | ||
| if (k <= 0 || k > arr.lenth) { | ||
| throw new Error('Invalid value for K'); | ||
| } | ||
| return arr[arr.length - k]; | ||
| } | ||
|
|
||
| // // 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); | ||
|
|
||
| // // find 3rd max | ||
| // console.log(findKthMax(myBST.root, 3)); | ||
|
|
||
| module.exports = findKthMax; |
39 changes: 39 additions & 0 deletions
src/_DataStructures_/Trees/BinarySearchTree/find-kth-min/index.js
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,39 @@ | ||
| // eslint-disable-next-line no-unused-vars | ||
| const BST = require('../index'); | ||
|
|
||
| // Inorder traversal returns a sorted array | ||
| function inOrderTraversal(root) { | ||
| if (root === null) return []; | ||
| let arr = []; | ||
| // traverse left | ||
| const left = inOrderTraversal(root.leftChild); | ||
| arr = [...left, root.value]; | ||
| const right = inOrderTraversal(root.rightChild); | ||
| return [...arr, ...right]; | ||
| } | ||
|
|
||
| function findKthMin(rootNode, k) { | ||
| const arr = inOrderTraversal(rootNode); | ||
| if (k <= 0 || k > arr.lenth) { | ||
| throw new Error('Invalid value for K'); | ||
| } | ||
| return arr[k - 1]; | ||
| } | ||
|
|
||
| // // 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); | ||
| // myBST.add(0); | ||
|
|
||
| // console.log(findKthMin(myBST.root, 3)); | ||
|
|
||
| module.exports = findKthMin; |
33 changes: 33 additions & 0 deletions
src/_DataStructures_/Trees/BinarySearchTree/height-of-bst/index.js
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,33 @@ | ||
| // eslint-disable-next-line no-unused-vars | ||
| const BST = require('../index'); | ||
|
|
||
| function findHeightOfBST(root) { | ||
| let leftHeight = 0; | ||
| let rightHeight = 0; | ||
|
|
||
| if (root === null) return 0; | ||
| leftHeight = findHeightOfBST(root.leftChild); | ||
| rightHeight = findHeightOfBST(root.rightChild); | ||
|
|
||
| if (leftHeight > rightHeight) { | ||
| return leftHeight + 1; | ||
| } | ||
| return rightHeight + 1; | ||
| } | ||
|
|
||
| // create a BST | ||
| // const myBST = new BST(6); | ||
| // myBST.add(4); | ||
| // myBST.add(9); | ||
| // myBST.add(2); | ||
| // myBST.add(5); | ||
| // myBST.add(14); | ||
| // myBST.add(8); | ||
| // myBST.add(12); | ||
| // myBST.add(10); | ||
|
|
||
| // // console.log(myBST.root); | ||
| // console.log(myBST.traversePreorder()); | ||
| // console.log(findHeightOfBST(myBST.root)); | ||
|
|
||
| module.exports = findHeightOfBST; |
File renamed without changes.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.