Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!uakari.primate.wisc.edu!brutus.cs.uiuc.edu!psuvax1!ukma!kminor
From: kminor@ms.uky.edu (Kevin R. Minor)
Newsgroups: comp.lang.c
Subject: clearing entire memory
Message-ID: <13367@s.ms.uky.edu>
Date: 30 Nov 89 04:06:32 GMT
Reply-To: kminor@ms.uky.edu (Kevin R. Minor)
Organization: U of Kentucky, Mathematical Sciences
Lines: 19

Hello.

I am doing a term paper, and I've run into an interesting question.

I am }iattempting to implement an AVL tree.  I have the insertion
and deletion routines.  I'm using pointers to access the nodes of
the tree.

Here's my question.  Is there a way to free up the entire memory
without having to deallocate each node?  If I can free the entire tree
structure in one step, it will dramatically save in run-time.  Either way,
I'd like to know for my paper.

Thanks in advance.

Kevin (kminor@ms.uky.edu)

-- 
Not much going on around here.