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