File maintenance by using AVL trees (an implementation of payroll system).
Alice Ming-Mei Chen · 1981
File Maintenance by Using AVL Trees (An Implementation of Payroll System) by Alice Ming-Mei Chen Binary search tree are in competition with other methods for organization files, such as : hash-coding or scatter storage techniques; linear lists, either sequentially allocated,or chained; other kinds of trees, such as : tries, or multiway trees of various kinds and methods that are based on a combination of such techniques as indexed-sequential file organization. Binary search trees are one of the most flexible and best understood techniques for organizing large files. Because of this, they have received a great deal of attention in recent years, and their properties are now better understood than those of most other file organization methods. Their practical importance comes mainly from the fact that they perfom with reasonable efficiency all of the common operations on files: random and sequential processing of a file, insertion and deletion of records, and restructuring of the file. And they can be allocated in reasonable ways In back-up storage devices with restricted access. In addition to their practical importance, they are of theoretical interest because they generate mathematical problems which arise in many other areas of information processing : sorting, coding and information theory, and others. This thesis present a method of designing an payroll system by using AVL trees and file structure. A noteworthy aspect of the tree algorithm is the use of recursion and concept of a virtual root. processes(batch, and on-line) are dicussed, modeled, and programmed.