On the generation of binary trees from (0-1) codes

An efficient recursive a algorithm for the generating all shapes of binary trees with n-nodes is presented. A binary tree with n-nodes is represented by 2(n−1) zeros and ones in a certain predetermined order. This scheme encodes the non-null links of a binary tree by 1's and the null links by 0...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of computer mathematics Ročník 69; číslo 3-4; s. 243 - 251
Hlavní autoři: Ahrabian, H., Nowzari-Dalini, A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Gordon and Breach Science Publishers 01.01.1998
Taylor and Francis
Témata:
Binary tree
code
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
G.2.1 Combinatorial Algorithm
G.2.2 Graph Theory (Trees)
Graph theory
Mathematics
recursion
Sciences and techniques of general use
traversal
Graph theory
Binary tree
Recursive algorithm
Algorithm
Code
ISSN:0020-7160, 1029-0265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract An efficient recursive a algorithm for the generating all shapes of binary trees with n-nodes is presented. A binary tree with n-nodes is represented by 2(n−1) zeros and ones in a certain predetermined order. This scheme encodes the non-null links of a binary tree by 1's and the null links by 0's in a pre-order traversal. The algorithm generates C n numbers of such codes. The algorithm is based on the idea of shifting '1' bits one space to the right. It is shown that the generation time per tree is constant O(1). The ranking and unranking algorithms are discussed. Also, an alternate way to obtain the Catalan numbers is given.
AbstractList An efficient recursive a algorithm for the generating all shapes of binary trees with n-nodes is presented. A binary tree with n-nodes is represented by 2(n−1) zeros and ones in a certain predetermined order. This scheme encodes the non-null links of a binary tree by 1's and the null links by 0's in a pre-order traversal. The algorithm generates C n numbers of such codes. The algorithm is based on the idea of shifting '1' bits one space to the right. It is shown that the generation time per tree is constant O(1). The ranking and unranking algorithms are discussed. Also, an alternate way to obtain the Catalan numbers is given.
Author Ahrabian, H.
Nowzari-Dalini, A.
Author_xml – sequence: 1
  givenname: H.
  surname: Ahrabian
  fullname: Ahrabian, H.
  organization: Department of Mathematics and Computer Science, Faculty of Science , University of Tehran
– sequence: 2
  givenname: A.
  surname: Nowzari-Dalini
  fullname: Nowzari-Dalini, A.
  organization: Institute for Studies in Theoretical Physics and Mathematics (IPM)
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1960315$$DView record in Pascal Francis
BookMark eNqFkD9PwzAQxS1UJNrCB2DzwABD4OzEsSOxoIp_UqUuMFuOY4NRale2Jei3J6WFAQRMN9z7vXf3JmjkgzcIHRM4JyDgAoACJ3UjQAioOCV7aEyANgXQmo3QeLMvBgEcoElKLwAgGl6PEV14nJ8NfjLeRJVd8DhY3Dqv4hrnaEzCNoYlPoWCnGEdOpMO0b5VfTJHuzlFjzfXD7O7Yr64vZ9dzQtdcpaLmilgouZtbRUBYsu2ailjVcc1Y9AJ02guVAtMU0M7wRTviGpEZRWHttJQTtHJ1nelkla9jcprl-QquuVwnCRNDSVhg4xvZTqGlKKxUrv88UmOyvWSgNw0JH80NJDkG_nl_QezS3PehrhUryH2ncxq3Yf4eeEPSua3PJCX_5Ll78HvrsyL4w
CODEN IJCMAT
CitedBy_id crossref_primary_10_1080_00207160310001624214
crossref_primary_10_1080_00207169808804721
Cites_doi 10.1016/0196-6774(90)90030-I
10.1080/00207169308804197
10.1007/BF00288468
10.1137/0206055
10.1080/00207169808804721
10.1145/322077.322082
10.1080/00207169208804058
10.1006/jagm.1993.1045
10.1016/0304-3975(80)90073-0
10.1016/0196-6774(85)90040-9
10.1080/00207168508803477
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 1998
1999 INIST-CNRS
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 1998
– notice: 1999 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1080/00207169808804721
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Mathematics
EISSN 1029-0265
EndPage 251
ExternalDocumentID 1960315
10_1080_00207169808804721
8804721
GroupedDBID -~X
.7F
.QJ
0BK
0R~
1TA
30N
4.4
5GY
5VS
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABUFD
ABXUL
ABXYU
ACAGQ
ACGEJ
ACGFS
ACGOD
ACIWK
ACNCT
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AGROQ
AHDZW
AHMOU
AI.
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALCKM
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMEWO
AMVHM
AQTUD
AVBZW
AWYRJ
BLEHA
CAG
CCCUG
CE4
COF
CRFIH
CS3
DGEBU
DKSSO
DMQIW
DU5
EBS
EJD
ESX
E~A
E~B
GTTXZ
H13
HZ~
H~P
J.P
KYCEM
M4Z
NA5
NUSFT
NY~
O9-
P2P
PQQKQ
QCRFL
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEJ
TFL
TFT
TFW
TN5
TOXWX
TTHFI
TUROJ
TWF
UPT
UT5
UU3
VH1
WH7
ZGOLN
~S~
.4S
.DC
07G
29J
AAIKQ
AAKBW
AAYJJ
AAYXX
ABDBF
ABEFU
ACGEE
ACTCW
ACTIO
ACUHS
AEUMN
AFFNX
AGCQS
AGLEN
AMXXU
AQRUH
ARCSS
BCCOT
BPLKW
C06
CITATION
DWIFK
EAP
EDO
EMK
EPL
EST
HF~
H~9
IPNFZ
IVXBP
LJTGL
MK~
RIG
TAQ
TFMCV
TUS
UB9
UU8
V3K
V4Q
ZY4
ADYSH
IQODW
ID FETCH-LOGICAL-c375t-65a05867b6fa101f3b4b2554d7c550d8e9c78ab05c2e2d85a7d1a984fa70b4c03
IEDL.DBID TFW
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000084098600003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-7160
IngestDate Mon Jul 21 09:11:18 EDT 2025
Tue Nov 18 21:58:46 EST 2025
Sat Nov 29 02:21:26 EST 2025
Mon May 13 12:10:04 EDT 2019
Mon Oct 20 23:31:41 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3-4
Keywords Graph theory
Binary tree
Recursive algorithm
Algorithm
Code
Language English
License CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c375t-65a05867b6fa101f3b4b2554d7c550d8e9c78ab05c2e2d85a7d1a984fa70b4c03
PageCount 9
ParticipantIDs pascalfrancis_primary_1960315
crossref_citationtrail_10_1080_00207169808804721
informaworld_taylorfrancis_310_1080_00207169808804721
crossref_primary_10_1080_00207169808804721
PublicationCentury 1900
PublicationDate 1/1/1998
1998-01-00
1998
PublicationDateYYYYMMDD 1998-01-01
PublicationDate_xml – month: 01
  year: 1998
  text: 1/1/1998
  day: 01
PublicationDecade 1990
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle International journal of computer mathematics
PublicationYear 1998
Publisher Gordon and Breach Science Publishers
Taylor and Francis
Publisher_xml – name: Gordon and Breach Science Publishers
– name: Taylor and Francis
References Ahrabian H. (CIT0001)
CIT0010
CIT0011
CIT0003
CIT0002
CIT0005
CIT0004
CIT0007
CIT0006
CIT0009
CIT0008
References_xml – ident: CIT0010
  doi: 10.1016/0196-6774(90)90030-I
– ident: CIT0002
  doi: 10.1080/00207169308804197
– ident: CIT0004
  doi: 10.1007/BF00288468
– ident: CIT0009
  doi: 10.1137/0206055
– volume-title: Generation of binary trees, from (0–1) codes
  ident: CIT0001
  doi: 10.1080/00207169808804721
– ident: CIT0008
  doi: 10.1145/322077.322082
– ident: CIT0003
  doi: 10.1080/00207169208804058
– ident: CIT0005
  doi: 10.1006/jagm.1993.1045
– ident: CIT0011
  doi: 10.1016/0304-3975(80)90073-0
– ident: CIT0007
  doi: 10.1016/0196-6774(85)90040-9
– ident: CIT0006
  doi: 10.1080/00207168508803477
SSID ssj0008976
Score 1.4663298
Snippet An efficient recursive a algorithm for the generating all shapes of binary trees with n-nodes is presented. A binary tree with n-nodes is represented by 2(n−1)...
SourceID pascalfrancis
crossref
informaworld
SourceType Index Database
Enrichment Source
Publisher
StartPage 243
SubjectTerms Binary tree
code
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
G.2.1 Combinatorial Algorithm
G.2.2 Graph Theory (Trees)
Graph theory
Mathematics
recursion
Sciences and techniques of general use
traversal
Title On the generation of binary trees from (0-1) codes
URI https://www.tandfonline.com/doi/abs/10.1080/00207169808804721
Volume 69
WOSCitedRecordID wos000084098600003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  customDbUrl:
  eissn: 1029-0265
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008976
  issn: 0020-7160
  databaseCode: TFW
  dateStart: 19640101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED6hioGF8hTlJQ8MgGTJaeJHRoSomApDEd0iP2KEhFrUBMTPx5ekoQXUAfbzQ74722fffR_AGc95JJzKqeZG0kQqTrUygkaOx6GJTq11FdmEHA7VeJzeN7k5RZNWiTG0r4Eiqr0anVubYp4RhxXcDEFeVPAQBDvE4Ccc--iWo8Fjuw-rtKKWQ2kaxNs_zd96WDqVljBLMVlSF2G9fE10sXD6DLr_nPcWbDbXTnJV28k2rOWTHejOKR1I4-G70L-bkHAlJE8VGjUqjUw9MVXRLsEP7IJgQQo5ZzS6IFgPX-zBw-BmdH1LG1oFamPJSyq4ZlwJaYTXwSF9bBITAovESRvClaC31EqlDeO2n_ed4lq6SKcq8Voyk1gW70NnMp3kB0CEl14LoRV3NmEuSUPHUliLu0KsXdwDNl_WzDaY40h98ZJFLTTptzXpwWXb5LUG3FglzBZ1lZXVK0ejqZ_iWflR9oCvaBKvGOpkyQ6-JpciUTc__GO_R7BRlzniq84xdMrZW34C6_a9fC5mp5VFfwJuCe8Y
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEA5SBb1Yn1i1moMHFQLZ7uaxRxFLxVo9VOxtyWMjgmylu4o_3yS7XVuVHvQ-eZCZSTKTzPcBcEJSElDNUySIZChinCDBJUWBJqFtImKltCebYIMBH43i-yrhllffKl0MbUqgCL9XO-d2yejplzhXwo0dygu3LuLQDm30s-yZ6aw9D7uP9U7MY08u58SRla9fNX_rYu5cmkMtdd8lRW5XzJRUFzPnT7f535lvgPXq5gkvSlPZBEtptgWaU1YHWDn5NujcZdDeCuGTB6R2eoNjA6Wv24XuDTuHriYFnmIUnEFXEp_vgIfu1fCyhypmBaRCRgpEicCEUyapEdYnTSgjaWOLSDNlIxarulgxLiQmqpN2NCeC6UDEPDKCYRkpHO6CRjbO0j0AqWFGUCo40SrCOoptx4wq5TaGUOiwBfB0XRNVwY479ouXJKjRSb-tSQuc101eS8yNRcJ4VllJ4RMdlap-iifFR9ECZEGTcMFQ7TlD-Jpc7Li6yf4f-z0Gq73hbT_pXw9uDsBaWfXokjyHoFFM3tI2WFHvxXM-OfLm_QmwlfNG
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB6kinixPrFqNQcPKgSy3c1jj6IuilJ7qNjbkk02Ikhbuqv48012t2ur0oPeJw8yM0kmmfk-gBOaUo9pkWJJE44DLiiWImHY09S3TWSolC7IJni3KwaDsFfl5mRVWqWLoU0JFFHs1c65x9pMM-JcBTdxIC_CeogDO7TBz7K9NjPnl_3oqd6IRVhwyzlxbOXrT83fupg7luZAS122pMzsgpmS6WLm-Ima_5z4BqxX9050URrKJiylwy1oTjkdUOXi29B5GCJ7J0TPBRy10xoaGZQUVbvI_WBnyFWkoFOCvTPkCuKzHXiMrvuXN7jiVcDK5zTHjEpCBeMJM9J6pPGTILGRRaC5svGKVVyouJAJoaqTdrSgkmtPhiIwkpMkUMTfhcZwNEz3ADHDjWRMCqpVQHQQ2o45U8ptC77UfgvIdFljVYGOO-6L19irsUm_rUkLzusm4xJxY5EwmdVVnBfPHJWmforH-UfeArqgib9gqPacHXxNLnRM3XT_j_0ew2rvKorvb7t3B7BWljy6F55DaOSTt7QNK-o9f8kmR4VxfwK25PHv
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+generation+of+binary+trees+from+%280-1%29+codes&rft.jtitle=International+journal+of+computer+mathematics&rft.au=AHRABIAN%2C+H&rft.au=NOWZARI-DALINI%2C+A&rft.date=1998&rft.pub=Taylor+and+Francis&rft.issn=0020-7160&rft.volume=69&rft.issue=3-4&rft.spage=243&rft.epage=251&rft_id=info:doi/10.1080%2F00207169808804721&rft.externalDBID=n%2Fa&rft.externalDocID=1960315
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7160&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7160&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7160&client=summon