Skip Navigation

The Computer Journal 1988 31(4):330-335; doi:10.1093/comjnl/31.4.330
© 1988 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 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 Sipala, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Efficient Implementation of Binary Trees in LISP Systems

P. Sipala

Dipartimento di Elettrotecnica, Elettronica, Informatica, Università di Trieste, Italy

Received 1 December 1986; revised 1 November 1987

In this paper, I consider how to implement the basic data structure of LISP programming, the binary tree. I show that, for the compact encoding of LISP trees, three-pointer cells are preferable to the conventional two-pointer ones. The result is one I reported previously, but here the analysis is done more elegantly, using the methods of probabilistic grammars. I also present a detailed implementation of LISP operators for the case in which multi-pointer cells are adopted.


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.