Page "AVL tree" Paragraph 6
from
Wikipedia
If each node additionally records the size of its subtree ( including itself and its descendants ), then the nodes can be retrieved by index in O ( log n ) time as well.
Page 1 of 1.
1.866 seconds.