Re: How to implement heap as a binary tree in lisp?
- From: "andrew.baine@xxxxxxxxx" <andrew.baine@xxxxxxxxx>
- Date: Fri, 28 Sep 2007 14:47:44 -0000
By weight do you mean the depth/height of each node? Could you please
elaborate it a bit.
Thanks
I mean the number elements in the sub-tree rooted at each node.
(defstruct heap-node
item
weight
left
right)
I'm sorry I'm at work and don't have time to expand. Check out
http://common-lisp.net/project/funds/
.
- References:
- How to implement heap as a binary tree in lisp?
- From: riahasan85
- Re: How to implement heap as a binary tree in lisp?
- From: andrew.baine@xxxxxxxxx
- Re: How to implement heap as a binary tree in lisp?
- From: riahasan85
- How to implement heap as a binary tree in lisp?
- Prev by Date: Re: If VB.NET had CL macros....
- Next by Date: Re: declare 64 bit integers?
- Previous by thread: Re: How to implement heap as a binary tree in lisp?
- Next by thread: p4switch - little app that switches between different P4 servers
- Index(es):
Relevant Pages
|
