Add traversal complexity (previous, next element)

[miclill]

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.