A transformation on ordered trees
Open Access
- 1 January 1980
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 23 (2) , 161-164
- https://doi.org/10.1093/comjnl/23.2.161
Abstract
The paper introduces a new transformation on ordered trees which is used to compute a few average properties of ordered trees. The properties that are studied are: (a) the average path length of an ordered tree with n nodes, (b) the average number of terminal nodes of an ordered tree with n nodes and (c) its average height. An algorithm is also presented to effect this transformation on any ordered tree T. The algorithm is linear in the number of nodes in T.Keywords
This publication has 0 references indexed in Scilit: