Skip to content

refactor: optimize code #39

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

Merged
yusuf601 merged 1 commit into from
Nov 20, 2025
Merged

refactor: optimize code #39

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
20 changes: 20 additions & 0 deletions Binary_Search_Tree/floor_and_ceil/ceil.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -64,6 +64,26 @@ int ceil(Node* root,int key){
}
return _min;
}
int optimization(Node* root,int x){
if(!root){
return -1;
}
int successor = -1;
while (root) {
if (x == root->data) {
return x; // case 1: key ditemukan
}
else if (x < root->data) {
successor = root->data; // calon successor
root = root->left;
}
else {
root = root->right;
}
}

return successor; // jika tidak dapat successor → tetap -1
}
int main(){
/**
8
Expand Down