A numbering system for binary trees

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A numbering system for binary trees

Full text

Pdf (286 KB)

Source

Communications of the ACM archive
Volume 20 , Issue 2 (February 1977) table of contents

Pages: 113 - 115

Year of Publication: 1977

ISSN:0001-0782

Author

Gary D. Knott

National Institutes of Health, Bethesda, MD

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 65, Citation Count: 12

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/359423.359434 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Gary Don Knott, Deletion in binary storage trees., 1975
	2	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	3	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998

CITED BY 12

	Marvin Solomon , Raphael A. Finkel, A Note on Enumerating Binary Trees, Journal of the ACM (JACM), v.27 n.1, p.3-5, Jan. 1980
	Harold W. Martin, Transformations between tree permutations and inversion tables, Proceedings of the 1990 ACM annual conference on Cooperation, p.140-146, February 20-22, 1990, Washington, D.C., United States
	David Zerling, Generating binary trees using rotations, Journal of the ACM (JACM), v.32 n.3, p.694-701, July 1985
	S. Olariu , J. L. Schwing , Z. Wen , J. Zhang, Optimal parallel encoding and decoding algorithms for trees, Proceedings of the 19th annual conference on Computer Science, p.1-10, April 1991, San Antonio, Texas, United States
	Doron Rotem , Y. L. Varol, Generation of Binary Trees from Ballot Sequences, Journal of the ACM (JACM), v.25 n.3, p.396-404, July 1978
	H. W. Martin , B. J. Orr, A random binary tree generator, Proceedings of the 17th conference on ACM Annual Computer Science Conference, p.33-38, February 21-23, 1989, Louisville, Kentucky
	Carl E. Langenhop , William E. Wright, An efficient model for representing and analyzing B-trees, Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective, p.35-40, October 1985, Denver, Colorado, United States
	Renzo Sprugnoli, The generation of binary trees as a numerical problem, Journal of the ACM (JACM), v.39 n.2, p.317-327, April 1992
	Selim G. Akl , Ivan Stojmenovic, Generating t-ary trees in parallel, Nordic Journal of Computing, v.3 n.1, p.63-71, Spring 1996
	Jun-ichi Aoe, A compendium of key search references, ACM SIGIR Forum, v.24 n.3, p.26-42, Fall 1990
	Ro-Yu Wu , Jou-Ming Chang , Yue-Li Wang, A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations, Theoretical Computer Science, v.355 n.3, p.303-314, 14 April 2006
	Hayedeh Ahrabian , Abbas Nowzari-Dalini, Parallel generation of binary trees in A-order, Parallel Computing, v.31 n.8+9, p.948-955, August 2005

INDEX TERMS

Keywords:
binary search trees, binary trees, permutations, ranking function

Collaborative Colleagues:

Gary D. Knott: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player