X-Git-Url: http://nsz.repo.hu/git/?p=musl;a=blobdiff_plain;f=src%2Fsearch%2Ftsearch_avl.c;h=b56159b9baf05041ba3958cb8bf949602574190f;hp=f5c2cf61da99decc3b091ddcbc0bef025ada1116;hb=6255c4c6a5599724d18311a7776aebe67f8e6d4a;hpb=d197d6421c317145e2aff89dd41de9d03eeaa00b

diff --git a/src/search/tsearch_avl.c b/src/search/tsearch_avl.c
index f5c2cf61..b56159b9 100644
--- a/src/search/tsearch_avl.c
+++ b/src/search/tsearch_avl.c
@@ -1,6 +1,12 @@
 #include <stdlib.h>
 #include <search.h>
 
+/*
+avl tree implementation using recursive functions
+the height of an n node tree is less than 1.44*log2(n+2)-1
+(so the max recursion depth in case of a tree with 2^32 nodes is 45)
+*/
+
 struct node {
 	const void *key;
 	struct node *left;