FTP, identify this simple data structure, similar to an array, but which uses pointers to arrange the objects in a linear order.
It can be used to simulate more complex data structures like mergeable heaps, and has a worst case search time on the order of the number of objects, since each object needs to be examined until a match is found, or until a null pointer is reached. Variations include also keeping a previous pointer in order to facilitate traversal, and the circular form, where the head object points to the tail and vice versa. FTP, identify this simple data structure, similar to an array, but which uses pointers to arrange the objects in a linear order.
It can be used to simulate more complex data structures like mergeable heaps, and has a worst case search time on the order of the number of objects, since each object needs to be examined until a match is found, or until a null pointer is reached.
linked list