By Topic

A note on definitions of trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Petry, F.E. ; Dept. of Comput. Sci., Tulane Univ., New Orleans, LA, USA ; Tucci, R.P.

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.

Published in:

Education, IEEE Transactions on  (Volume:32 ,  Issue: 3 )