A discussion of the new balanced tree searching technique and its use in accelerating incremental allocation and branch and bound algorithms. Balanced tree searching is an efficient scheme for finding an item of a given value in a list, inserting an ...
