index 4e4d00c1b95f37742eab50cf7cd4226511ee8e60..548c69506d0215ae8d893ffc18ea7e7646486969 100644 (file)
* An AVL tree implements Adelson-Velskii and Landis' self-balancing search
* tree. It supports search, insert, and delete operations in average and
* worst-case time-complexity O(log n).
- *
- * XXX: self-balancing is not implemented yet
*/
struct sdb_avltree;
typedef struct sdb_avltree sdb_avltree_t;