About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Theoretical Computer Science
Paper
(g0, g1, ..., gk)-trees and unary OL systems
Abstract
In this paper we extend the notion of (2, 3)-trees and AVL trees to (g0, g1,..., gk)-trees and (g1, g2,...,gk)-AVL trees, respectively, where 1≤g0<g1<g2<...<gk. Complete characterization of these two classes of trees in terms of their generators g0, g1,..., gk is given and the connection between (g0, g1,... gk)-trees and unary OL systems is mentioned. © 1983.