Lines Matching defs:node
6 the height of an n node tree is less than 1.44*log2(n+2)-1
10 struct node {
12 struct node *left;
13 struct node *right;
17 static int delta(struct node *n) {
21 static void updateheight(struct node *n) {
30 static struct node *rotl(struct node *n) {
31 struct node *r = n->right;
39 static struct node *rotr(struct node *n) {
40 struct node *l = n->left;
48 static struct node *balance(struct node *n) {
64 static struct node *find(struct node *n, const void *k,
80 static struct node *insert(struct node *n, const void *k,
81 int (*cmp)(const void *, const void *), struct node **found)
83 struct node *r;
112 static struct node *remove_rightmost(struct node *n, struct node **rightmost)
122 static struct node *remove(struct node **n, const void *k,
123 int (*cmp)(const void *, const void *), struct node *parent)
131 struct node *r = *n;
156 struct node *n = *rootp;
157 struct node *ret;
159 which is returned when the root node is deleted */
176 struct node *update;
177 struct node *ret;
186 static void walk(const struct node *r, void (*action)(const void *, VISIT, int), int d)