Pointerless

We will see, however, that the pointerless techniques are seldom satisfactory. Implementations of trees tend to be more complex than those of ordered lists.

The list representation is a pointerless representation that facilitates sequential access but is inefficient for random access to specific image elements.

But we can't use function pointers as we would in C++, and not just for the ideological reason that it doesn't enter into the spirit of the brave new pointerless world of the CLR.