Chapter 9 - Data structures with dynamical random transitions

Abstract

This chapter describes data structures with dynamical random transitions. The time and integrated space costs of sequences of operations on list structures can be generated by combinatorial methods. Dynamic data structures can be analyzed in a realistic model proposed by Knuth. This chapter illustrates the method to derive the asymptotic probability distribution on data structure sizes which can be considered as dynamic random walks. A data type is a specification of the basic operations, which can be allowed together with its set of possible restrictions. The data types commonly used are stack, linear list, dictionary, priority queue, and symbol table. A data organization is a machine implementation of a data type. It consists of a data structure which specifies the way objects are internally represented in the machine with a collection of algorithms. Stacks can be implemented by arrays or linked lists, whereas linear lists can be implemented by linked lists and arrays. Dictionaries can be usually implemented by sorted or unsorted lists.