-
Notifications
You must be signed in to change notification settings - Fork 12.9k
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
binary search tree #158
Comments
I think you are right. I did see him using BST with a balancing factor on youtube, so pontetially O(logn) is implied. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Hi,
I would maybe add for binary search trees that the O(log(n)) complexities are correct for the average complexities. For example if the tree has a "shape of a line" (every node has a child on the left : 10->9->8->7->6->5->4->3->2->1 then the worst case complexities will be O(n) ( search, insert, delete, access). If the values are deliberately written for the average complexities, then sorry for the disturbance :)
Kind Regards, Mark
The text was updated successfully, but these errors were encountered: