Balanced binary tree code for scientific applications

Published: 1 January 1989| Version 1 | DOI: 10.17632/stnhs36bc5.1
S.C. Park, J.P. Draayer


Abstract A set of easy-to-use FORTRAN routines for building and accessing data structures of the type commonly encountered in scientific applications is introduced. Fetch and insert times go as ≻ [log (n)], where n is the number of elements in the list. The routines implement AVL or height-balanced binary tree logic. Each tree is a linear integer array. The first ten elements of a tree array specify its structure and the remaining elements are dedicated to node information. Each node includes key and ... Title of program: BBTREE Catalogue Id: ABJR_v1_0 Nature of problem Typical scientific programming applications require numerous calls to one or more subroutines. The intermediate results generated by these calls are usually not saved; if the same information is required at a later stage it is simply recalculated. While wasteful of cpu power, this modus operandi is attractive because it spares the user the time and effort associated with the development of complicated data storage and retrieval algorithms. However, if the number of redundant calls to a particula ... Versions of this program held in the CPC repository in Mendeley Data ABJR_v1_0; BBTREE; 10.1016/0010-4655(89)90076-3 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)



Information Retrieval, Computational Physics, Computational Method, Database