1 2 3 4 5 6 7 8 9 10 11 12 13
#include <search.h> #include <features.h> /* AVL tree height < 1.44*log2(nodes+2)-0.3, MAXH is a safe upper bound. */ #define MAXH (sizeof(void*)*8*3/2) struct node { const void *key; void *a[2]; int h; }; hidden int __tsearch_balance(void **);