[fpc-pascal] gtree - Freeing a nil Root without error

Daniel Gaspary dgaspary at gmail.com
Wed Jan 8 14:11:53 CET 2014


On Wed, Jan 8, 2014 at 3:31 AM, leledumbo <leledumbo_cool at yahoo.co.id> wrote:
> As in the data structure theory, a tree is just a graph without cycle.
> So I guess it should be made that way. There are a lot of graph and tree
> variations though, so I think I need to take some time to design before
> implementing.

I don't know if the edges information can not be irrelevant and even
an obstacle to better performance in trees.

Anyway, good to know these plans.

Thank you.



More information about the fpc-pascal mailing list