2 * Tree search generalized from Knuth (6.2.2) Algorithm T just like
3 * the AT&T man page says.
5 * The node_t structure is for internal use only, lint doesn't grok it.
7 * Written by reading the System V Interface Definition, not the code.
9 * Totally public domain.
11 * $NetBSD: tdelete.c,v 1.2 1999/09/16 11:45:37 lukem Exp $
12 * $FreeBSD: src/lib/libc/stdlib/tdelete.c,v 1.1.2.1 2000/08/17 07:38:39 jhb Exp $
13 * $DragonFly: src/lib/libc/stdlib/tdelete.c,v 1.5 2005/11/24 17:18:30 swildner Exp $
16 #include <sys/cdefs.h>
19 #define _SEARCH_PRIVATE
25 * delete node with given key
28 * vkey: key to be deleted
29 * vrootp: address of the root of tree
32 tdelete(const void *vkey, void **vrootp,
33 int (*compar)(const void *, const void *))
35 node_t **rootp = (node_t **)vrootp;
39 if (rootp == NULL || (p = *rootp) == NULL)
42 while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {
45 &(*rootp)->llink : /* follow llink branch */
46 &(*rootp)->rlink; /* follow rlink branch */
48 return NULL; /* key not found */
50 r = (*rootp)->rlink; /* D1: */
51 if ((q = (*rootp)->llink) == NULL) /* Left NULL? */
53 else if (r != NULL) { /* Right link is NULL? */
54 if (r->llink == NULL) { /* D2: Find successor */
57 } else { /* D3: Find NULL link */
58 for (q = r->llink; q->llink != NULL; q = r->llink)
61 q->llink = (*rootp)->llink;
62 q->rlink = (*rootp)->rlink;
65 free(*rootp); /* D4: Free node */
66 *rootp = q; /* link parent to new node */