![Sample our Bioscience journals, sign in here to start your access, Latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5925/TOC-Subject-Sample-2021-Bioscience.jpg"})
There is a one to one correspondence between the (0–1) sequences with dominating property and all the , regular binary trees with n internal nodes and (n + 1) terminal nodes. A recursive Pascal program of 0 (n log2
n) time complexity based on the coding scheme of [1] is proposed to generate all the b
n
(0–1) sequences.
Keywords:
C.R. CATEGORIES::
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.