When deleting an entire tree, start at head, not at root.

[oweals/tinc.git] / lib / avl_tree.c

diff --git a/lib/avl_tree.c b/lib/avl_tree.c
index 9a632e28e4babe15b1fc664c526147123c24fa9d..3bfdfeeeecaf1f23cd0252facf2692eabc816d13 100644 (file)
--- a/lib/avl_tree.c
+++ b/lib/avl_tree.c
@@ -1,9 +1,9 @@
 /*
     avl_tree.c -- avl_ tree and linked list convenience
     Copyright (C) 1998 Michael H. Buselli
-                  2000-2004 Ivo Timmermans <ivo@tinc-vpn.org>,
-                  2000-2004 Guus Sliepen <guus@tinc-vpn.org>
-                  2000-2004 Wessel Dankers <wsl@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
     it under the terms of the GNU General Public License as published by
@@ -656,7 +656,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);
        }