A note on definitions of trees
A number of definitions of trees appear in various courses of a computer engineering curriculum such as circuits or data structures. It is shown that a commonly used recursive definition of a tree is equivalent to a graph-theoretic definition. This puts the recursive definition in a better perspecti...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on education 1989-08, Vol.32 (3), p.396-398 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 398 |
|---|---|
| container_issue | 3 |
| container_start_page | 396 |
| container_title | IEEE transactions on education |
| container_volume | 32 |
| creator | Petry, F.E. Tucci, R.P. |
| description | A number of definitions of trees appear in various courses of a computer engineering curriculum such as circuits or data structures. It is shown that a commonly used recursive definition of a tree is equivalent to a graph-theoretic definition. This puts the recursive definition in a better perspective relative to the various equivalent forms of graph-based trees. Pedagogically, as both types of definitions are often introduced to students even in the same course, this approach should provide a strong basis for students to understand their relationship.< > |
| doi_str_mv | 10.1109/13.34180 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_13_34180</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>34180</ieee_id><sourcerecordid>28455113</sourcerecordid><originalsourceid>FETCH-LOGICAL-c274t-addc0180eb915decb2e6079da5306f520717ee1daeea4c9d758bdab0686149d83</originalsourceid><addsrcrecordid>eNo90MFLwzAUBvAgCtYpePUiPYmXzrwmaZLjGFMHg130HNLkFSJdM5Pu4H9vteLp8Xg_vgcfIbdAlwBUPwFbMg6KnpEChJCVbpg6JwWloCrNhL4kVzl_TCsXtSjI_aoc4ohlHEqPXRjCGOKQy9iVY0LM1-Sis33Gm7-5IO_Pm7f1a7Xbv2zXq13lasnHynrvpgcUWw3Co2trbKjU3gpGm07UVIJEBG8RLXfaS6Fab1vaqAa49ootyMOce0zx84R5NIeQHfa9HTCesqkVFwKATfBxhi7FnBN25pjCwaYvA9T8FGCAmd8CJno304CI_2y-fQNrBlOy</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28455113</pqid></control><display><type>article</type><title>A note on definitions of trees</title><source>IEEE Electronic Library (IEL)</source><creator>Petry, F.E. ; Tucci, R.P.</creator><creatorcontrib>Petry, F.E. ; Tucci, R.P.</creatorcontrib><description>A number of definitions of trees appear in various courses of a computer engineering curriculum such as circuits or data structures. It is shown that a commonly used recursive definition of a tree is equivalent to a graph-theoretic definition. This puts the recursive definition in a better perspective relative to the various equivalent forms of graph-based trees. Pedagogically, as both types of definitions are often introduced to students even in the same course, this approach should provide a strong basis for students to understand their relationship.< ></description><identifier>ISSN: 0018-9359</identifier><identifier>EISSN: 1557-9638</identifier><identifier>DOI: 10.1109/13.34180</identifier><identifier>CODEN: IEEDAB</identifier><language>eng</language><publisher>IEEE</publisher><subject>Circuits ; Computer science ; Data engineering ; Engineering students ; Graph theory ; Partitioning algorithms ; Tree data structures ; Tree graphs</subject><ispartof>IEEE transactions on education, 1989-08, Vol.32 (3), p.396-398</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c274t-addc0180eb915decb2e6079da5306f520717ee1daeea4c9d758bdab0686149d83</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/34180$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27915,27916,54749</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/34180$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Petry, F.E.</creatorcontrib><creatorcontrib>Tucci, R.P.</creatorcontrib><title>A note on definitions of trees</title><title>IEEE transactions on education</title><addtitle>TE</addtitle><description>A number of definitions of trees appear in various courses of a computer engineering curriculum such as circuits or data structures. It is shown that a commonly used recursive definition of a tree is equivalent to a graph-theoretic definition. This puts the recursive definition in a better perspective relative to the various equivalent forms of graph-based trees. Pedagogically, as both types of definitions are often introduced to students even in the same course, this approach should provide a strong basis for students to understand their relationship.< ></description><subject>Circuits</subject><subject>Computer science</subject><subject>Data engineering</subject><subject>Engineering students</subject><subject>Graph theory</subject><subject>Partitioning algorithms</subject><subject>Tree data structures</subject><subject>Tree graphs</subject><issn>0018-9359</issn><issn>1557-9638</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNo90MFLwzAUBvAgCtYpePUiPYmXzrwmaZLjGFMHg130HNLkFSJdM5Pu4H9vteLp8Xg_vgcfIbdAlwBUPwFbMg6KnpEChJCVbpg6JwWloCrNhL4kVzl_TCsXtSjI_aoc4ohlHEqPXRjCGOKQy9iVY0LM1-Sis33Gm7-5IO_Pm7f1a7Xbv2zXq13lasnHynrvpgcUWw3Co2trbKjU3gpGm07UVIJEBG8RLXfaS6Fab1vaqAa49ootyMOce0zx84R5NIeQHfa9HTCesqkVFwKATfBxhi7FnBN25pjCwaYvA9T8FGCAmd8CJno304CI_2y-fQNrBlOy</recordid><startdate>19890801</startdate><enddate>19890801</enddate><creator>Petry, F.E.</creator><creator>Tucci, R.P.</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19890801</creationdate><title>A note on definitions of trees</title><author>Petry, F.E. ; Tucci, R.P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c274t-addc0180eb915decb2e6079da5306f520717ee1daeea4c9d758bdab0686149d83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Circuits</topic><topic>Computer science</topic><topic>Data engineering</topic><topic>Engineering students</topic><topic>Graph theory</topic><topic>Partitioning algorithms</topic><topic>Tree data structures</topic><topic>Tree graphs</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Petry, F.E.</creatorcontrib><creatorcontrib>Tucci, R.P.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on education</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Petry, F.E.</au><au>Tucci, R.P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A note on definitions of trees</atitle><jtitle>IEEE transactions on education</jtitle><stitle>TE</stitle><date>1989-08-01</date><risdate>1989</risdate><volume>32</volume><issue>3</issue><spage>396</spage><epage>398</epage><pages>396-398</pages><issn>0018-9359</issn><eissn>1557-9638</eissn><coden>IEEDAB</coden><abstract>A number of definitions of trees appear in various courses of a computer engineering curriculum such as circuits or data structures. It is shown that a commonly used recursive definition of a tree is equivalent to a graph-theoretic definition. This puts the recursive definition in a better perspective relative to the various equivalent forms of graph-based trees. Pedagogically, as both types of definitions are often introduced to students even in the same course, this approach should provide a strong basis for students to understand their relationship.< ></abstract><pub>IEEE</pub><doi>10.1109/13.34180</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9359 |
| ispartof | IEEE transactions on education, 1989-08, Vol.32 (3), p.396-398 |
| issn | 0018-9359 1557-9638 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_13_34180 |
| source | IEEE Electronic Library (IEL) |
| subjects | Circuits Computer science Data engineering Engineering students Graph theory Partitioning algorithms Tree data structures Tree graphs |
| title | A note on definitions of trees |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T02%3A19%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20note%20on%20definitions%20of%20trees&rft.jtitle=IEEE%20transactions%20on%20education&rft.au=Petry,%20F.E.&rft.date=1989-08-01&rft.volume=32&rft.issue=3&rft.spage=396&rft.epage=398&rft.pages=396-398&rft.issn=0018-9359&rft.eissn=1557-9638&rft.coden=IEEDAB&rft_id=info:doi/10.1109/13.34180&rft_dat=%3Cproquest_RIE%3E28455113%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28455113&rft_id=info:pmid/&rft_ieee_id=34180&rfr_iscdi=true |