Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » By Affiliations
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top 20 Journal Cited
 » Top 20 Cited
 » Top 20 Author Cited
 » Usage Since Sept 2007


 
 
 

Login | Create Account

Generation of Binary Trees in B-Order From (0-1) Sequences

Ahrabian, Hayadeh and Nowzari-Dalini, Abbas (2004) Generation of Binary Trees in B-Order From (0-1) Sequences. Malaysian Journal of Computer Science, 17 (1). pp. 24-31. ISSN 0127-9084

Full text not available from this repository.

Official URL: http://mjcs.fsktm.um.edu.my/detail.asp?AID=285

Affiliations

University of Tehran

Abstract

An efficient recursive algorithm has been developed to generate binary trees in B-order from 0-1 sequences. The generation algorithm produces each tree in constant average time O(1). The ranking and unranking algorithms with O(n) time complexity are also presented.

Item Type:Journal
Keywords:Binary trees, B-order, 0-1 Sequences, Recursion
Subjects:Q Science
ID Code:384

D. K. Gupta, “A Note on The Generation of Binary Trees”. International Journal of Computer Mathematics, Vol. 48, 1993, pp. 149-152.

J. Lucas, D. Roelants Van Baronaigien and F. Ruskey, “On Rotations and the Generation of Binary Trees”. Journal of Algorithms, Vol. 15 No. 3, 1993, pp. 343-366.

J. Pallo and R. Racca, “A Note on Generating Binary Tree in A-order and B-order”. International Journal of Computer Mathematics, Vol. 18, 1985, pp. 27-39.

D. Roelants Van Baronaigien, “A Loopless Algorithm for Generating Binary Trees Sequences”. Information Processing Letters, Vol. 39 No. 4, 1991, pp. 189-194.

D. Rotem and Y. L. Varol, “Generation of Binary Trees from Ballot-sequences”. Journal of the ACM, Vol. 25 No. 3, 1978, pp. 396-404.

F. Ruskey and T. C. Hu, “Generating Binary Tree Lexicographically”. SIAM Journal on Computing, Vol. 6 No. 4, 1977, pp. 745-758.

V. Vajnovszki, “On The Loopless Generation of Binary Tree Sequences”. Information Processing Letters, Vol. 68 No. 3, 1998, pp. 113-117.

S. Zaks, “Lexicographic Generation of Ordered Tree”. Theoretical Computer Science, Vol. 10 No. 1, 1980, pp. 63-82.

H. Ahrabian and A. Nowzari-Dalini, “On the Generation of Binary Trees, from (0-1) Codes”. International Journal of Computer Mathematics, Vol. 69, 1998, pp. 243-251.

D. Rotem, “On a Correspondence Between Binary Tree and Certain Type of Permutation”. Information Processing Letters, Vol. 4 No. 3, 1975, pp. 58-61.

D. E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, (2nd ed.), Reading, MA, Addison-Wesley, 1973.

B. Bultena and F. Ruskey, “An Eades-McKay Algorithm for Well-Formed Parentheses String”. Information Processing Letters, Vol. 68 No. 5, 1998, pp. 255-259.

C. Germain and J. Pallo, “Two Shortest Path Metrics on Well-Formed Parentheses Strings”. Information Processing Letters, Vol. 60 No. 6, 1996, pp. 283-287.

M. C. Er, “A Note on Generating Well-Formed Parentheses String Lexicographically”. The Computer Journal, Vol. 26 No. 3, 1983, pp. 205-207.

Repository Staff Only: item control page
 
 
 
 
 
   
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.