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.

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

Add traversal complexity (previous, next element) #121

Open
miclill opened this issue Jul 10, 2017 · 0 comments
Open

Add traversal complexity (previous, next element) #121

miclill opened this issue Jul 10, 2017 · 0 comments

Comments

@miclill
Copy link

miclill commented Jul 10, 2017

This is sometimes different from the access time.
Example:
https://en.wikipedia.org/wiki/AVL_tree#Traversal

Once a node has been found in an AVL tree, the next or previous node can be accessed in amortized constant time.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant