Skip to content
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

Jump to bottom

Day 434 #870

Closed
vaskoz opened this issue Jan 30, 2020 · 1 comment · Fixed by #871
Closed

Day 434 #870

vaskoz opened this issue Jan 30, 2020 · 1 comment · Fixed by #871
Assignees
@vaskoz

Comments

@vaskoz
Copy link
Owner

vaskoz commented Jan 30, 2020

Good morning! Here's your coding interview problem for today.

This problem was asked by Oracle.

Given a binary search tree, find the floor and ceiling of a given integer. The floor is the highest element in the tree less than or equal to an integer, while the ceiling is the lowest element in the tree greater than or equal to an integer.

If either value does not exist, return None.
@vaskoz vaskoz self-assigned this Jan 30, 2020
@vaskoz
Copy link
Owner Author

vaskoz commented Jan 30, 2020

Identical to Day 307: #628

@vaskoz vaskoz mentioned this issue Jan 30, 2020
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@vaskoz vaskoz

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

Day434 vaskoz/dailycodingproblem-go
1 participant
@vaskoz