--___- - ---- - ~.~.-- - _-_---~_. __ __~- Binary Trees 5 la STL John S. Mallozzi lona College Department of Computer Science New Rochelle, NY 10801 JMallozzi@iona.edu Introduction With the arrival of a standard library for C!++ [l], particularly its container class templates - the Standard Template Library (STL) the questions arise whether and how to incorporate this material in the teaching of data structures, During the 1995- academic year, the 96 author chose one approach to this material. This paper discusses his treatment of binary trees using this approach. Use of STL made available a significant library of containers and algorithms. For data structures contained in the library, such as (linked) lists, we discussed possible implementations of these classes. For data structures not contained in the library, such as trees, we used the library both to motivate the design of the interface and to provide tools for the implementation. Although class time was needed to discuss the STL philosophy (and alternatives), the result of spending this time was, we believe, a more coherent approach to the course, and, in terms of both use and design, a greater understanding of libraries. Here, we describe how we
End of preview. The entire article is 5 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/binary-trees-la-stl-h8T0Da0OkP
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Binary trees á la STL
Mallozzi, John S.
Follow ACM SIGCSE Bulletin
, Volume 29 (1)
Association for Computing Machinery – Mar 1, 1997
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
