Skip Navigation

The Computer Journal 1983 26(3):193-195; doi:10.1093/comjnl/26.3.193
© 1983 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Evans, D. J.
Right arrow Articles by Abdollahzadeh, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Efficient Construction of Balanced Binary Trees

D. J. Evans * and F. Abdollahzadeh *

Department of Computer Studies, Loughborough University of Technology, Loughborough, UK

An improved algorithm for balancing arithmetic expression trees is presented and its efficiency considered. When binary trees are constructed to represent arithmetic expressions and vacant nodes occur then by making use of the vacancy in the tree we are able to insert a smaller tree of lower height resulting in a balanced binary tree (b.b.t.) which is more efficient than those given by existing methods.

Received August 1981.

* Department of Computer Studies, Loughborough University of Technology, Loughborough, Leicestershire, UK


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.