Skip to content

Solution #700 - Daniel/Edited - 12.03.2025 #28

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.

Sign up for GitHub

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

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Solution #700 - Daniel/Edited - 12.03.2025 #28

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f710b81
Solution #700 - Daniel/Edited - 12.03.2025
danzang100 Mar 12, 2025
a5ab8c2
Merge branch 'master' into feature/bst-search
JRS296 Mar 21, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions Trees (Binary Trees)/#700 - BST Search - Easy/Explanation - BST Search.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
Simple straightforward problem of traversing a bst to find a given element.
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Aight so this may be simple for you, but you ought to explain this as if you're explaining this to a child 😅
Give it more depth and detail, and if it's too much to explain, link some articles that do. Kindly format this in Markdown as well.

17 changes: 17 additions & 0 deletions Trees (Binary Trees)/#700 - BST Search - Easy/Solution - BST Search.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
class Solution {
public:
TreeNode* searchBST(TreeNode* root, int val) {
if(root != NULL){
Comment on lines +1 to +4
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Also check if this file exists in the repository as a java file, and if so, move it to your folder

if(root -> val == val) return root;
else{
if(root -> val < val){
return searchBST(root-> right, val);
}
else{
return searchBST(root->left, val);
}
}
}
return NULL;
}
};