| Originally published: Monday, 4 September 2000 | Author: Jeff Alami |
| Published to: news_develop_development/Development News | Page: 1/1 [Standard view] |
AVL C Library 0.1This data structure features fast (O(log N)) insertion, removal, and retrieval of records, provided that there is a sorting relation over their keys and there are no entries with equal keys.
|
|
(this article had no body text)