14 Aug
2010
14 Aug
'10
10:41 a.m.
09/08/2010 17:35, Adam Wulkiewicz wrote:
Yes, you're right. Although, there may be more than one allocators used in the tree building algorithm. There may be allocators for tree nodes, temporary objects at each recursive step and for objects in leafs.
I don't see why you'd need dynamic memory allocation other than for the nodes, assuming you're storing values and not not trying to store polymorphic objects through pointers.