Skip Navigation

The Computer Journal 1980 23(2):161-164; doi:10.1093/comjnl/23.2.161
© 1980 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dasarathy, B.
Right arrow Articles by Yang, C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A transformation on ordered trees

B. Dasarathy1 * and C. Yang2 § ¶

1 Department of Mathematics, Computer Science and Statistics, University of South Carolina, Columbia, USA, 2 GTE Automatic Electric Laboratories, 11226 N. 23rd Avenue, Phoenix, Arizona, USA

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.

Received October 1978.

* Department of Mathematics, Computer Science and Statistics, University of South Carolina, Columbia, SC 29208, USA

§ GTE Automatic Electric Laboratories, 11226 N. 23rd Avenue, Phoenix, Arizona, 85029, USA

The research reported here was conducted when the second author was a graduate student at the University of South Carolina


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.