X-Git-Url: http://git.meshlink.io/?a=blobdiff_plain;f=lib%2Favl_tree.c;h=8bb06cbf02fb82983ee14b9cedd529c0d9a4a79c;hb=0e6856b1379e278aa5ed116d0911851339a6064c;hp=6584ddf811374e798243e5e200ae954e4f42c468;hpb=df3220a1549f992cbf4a9b6e67c1e67b69896c7d;p=meshlink

diff --git a/lib/avl_tree.c b/lib/avl_tree.c
index 6584ddf8..8bb06cbf 100644
--- a/lib/avl_tree.c
+++ b/lib/avl_tree.c
@@ -1,8 +1,8 @@
 /*
     avl_tree.c -- avl_ tree and linked list convenience
     Copyright (C) 1998 Michael H. Buselli
-                  2000-2005 Ivo Timmermans <ivo@tinc-vpn.org>,
-                  2000-2005 Guus Sliepen <guus@tinc-vpn.org>
+                  2000-2005 Ivo Timmermans,
+                  2000-2006 Guus Sliepen <guus@tinc-vpn.org>
                   2000-2005 Wessel Dankers <wsl@tinc-vpn.org>
 
     This program is free software; you can redistribute it and/or modify
@@ -28,8 +28,6 @@
     Cleaned up and incorporated some of the ideas from the red-black tree
     library for inclusion into tinc (http://www.tinc-vpn.org/) by
     Guus Sliepen <guus@tinc-vpn.org>.
-
-    $Id$
 */
 
 #include "system.h"
@@ -656,7 +654,7 @@ void avl_delete_tree(avl_tree_t *tree)
 {
 	avl_node_t *node, *next;
 
-	for(node = tree->root; node; node = next) {
+	for(node = tree->head; node; node = next) {
 		next = node->next;
 		avl_free_node(tree, node);
 	}