Re: no :of nodes

"Richard Harter" <cri@[EMAIL PROTECTED]
> wrote in message 
news:482268d8.100836171@[EMAIL PROTECTED]
> On Wed, 7 May 2008 17:22:50 -0700, "Chris Thomasson"
> <cristom@[EMAIL PROTECTED]
> wrote:
>
>>"Chris Thomasson" <cristom@[EMAIL PROTECTED]
> wrote in message
>>news:vLGdndQrSbqk2L_VnZ2dnUVZ_rjinZ2d@[EMAIL PROTECTED]
>>>
>>> Its no good. Use dynamic allocation if the level count of the tree is 
>>> not
>>> known in advance. Also, recursion is not safe. Passing some tress to 
>>> this
>>> function will blow the stack. There are ways to traverse a tree
without
>>> using recursion. Here is a simple example:
[...]
>>
>>http://pastebin.com/m3e5a9fd8
[...]
>>> Instead of threading the tree, you can include an auxiliary node that
a
>>> traversal function uses as an node to link into a local queue. Check
the
>>> 'destroy_tree()' function...
>
>
> If I read the code correctly, it makes a separate malloc call for
> each new node.  While legal, that makes for inefficient code.  It
> is better to allocate space for a block of nodes and link them
> into a free list.  There are other alternatives, but the essence
> is that one malloc per node is expensive and should be avoided in
> production code.

You can hook it up to the following crude region allocator I did:

http://pastebin.com/m52ba914

http://groups.google.com/group/comp.lang.c/browse_frm/thread/f8f65273b09b4229


Now, the tree program can look something like:

http://pastebin.com/m757377c3


The region allocator simply increments a counter and bumps a pointer along

the buffer until the end is reached, then another region is allocated. 
Deallocations consist of decrementing the counter and resetting the 
allocator state when zero is reached. It can dynamically expand and
shrink. 
It can also amortize calls to free into a single "reset" call. The example

code shows this...


Any thoughts?