提交 6255c4c6 编写于 作者: N nsz

search: add comments to tsearch_avl.c

上级 d197d642
#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;
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册