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

Implement red-black tree to optimize search #7

Open

BigETI opened this issue Jul 28, 2018 · 0 comments

Labels

enhancement Hacktoberfest

Owner

BigETI commented Jul 28, 2018

Insertion and search takes in a worst case scenario would take from O(n) (current) to O(log n).

BigETI added the enhancement label

BigETI added the Hacktoberfest label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment