hi,
please, I´m looking for some tested/efficient object pascal code for
basic operations (create, insert, search, delete) on n-ary trees and
doubly linked lists (circular, with tail = head); so far I found a
commercial component and will give it a try, but that´s a very common
undergraduate task, so maybe someone can point me to an open code.
thanks,
Carlos





-----------------------------------------------------
Home page: http://groups.yahoo.com/group/delphi-en/
To unsubscribe: [EMAIL PROTECTED] 
Yahoo! Groups Links

<*> To visit your group on the web, go to:
    http://groups.yahoo.com/group/delphi-en/

<*> To unsubscribe from this group, send an email to:
    [EMAIL PROTECTED]

<*> Your use of Yahoo! Groups is subject to:
    http://docs.yahoo.com/info/terms/
 


Reply via email to