Pattern conserving data structure and algorithms for computations on dendritic trees.

The linked list is offered as a pattern conserving data structure, useful for storing neuronal dendritic trees. A BASIC language algorithm is described. Modifications of this algorithm for building linked lists, graphing dendritic trees, and tarry ordering trees are presented. Brief mention is made of the last in first out stack as a alternative data structure for computations on dendritic trees.