[libc-commits] [libc] [libc][tsearch] add weak AVL tree for tsearch implementation (PR #172411)

[Fangrui Song via libc-commits]

MaskRay wrote:

Yes, the 2-bit approach (Store two bits representing the rank differences to each child) has slightly smaller code size and has a performance advantage (due to accessing fewer nodes when walking bottom-up).

https://github.com/llvm/llvm-project/pull/172411