Hey guys, just in case: It's obvious that if you allocate memory for an array of pointer to a structure you don't allocate memory for the structures/objects. I thought that everybody would be aware of that.
Walking though an half-binary-tree (that is, any element has only a pointer one following pointer) is much more flexible than a simple array of pointers. You aren't limited to a maximum number of elements and it's easy to add new elements to the beginning/end/middle, without any memmoves or possible memory leaks while reallocating memory for the grown array of pointers.
There were some problems also, like you can't get the last element with the current, but I think it won't be a real contra point.