Fundamentals of Computer Science I: Media Computing (CS151.01 2008S)
[Skip to Body]
Primary:
[Front Door]
[Syllabus]

[Academic Honesty]
[Instructions]
Current:
[Outline]
[EBoard]
[Reading]
[Lab]
[Assignment]
Groupings:
[Assignments]
[EBoards]
[Examples]
[Exams]
[Handouts]
[Labs]
[Outlines]
[Projects]
[Readings]
References:
[AZ]
[Primary]
[Scheme Report (R5RS)]
[Scheme Reference]
[DrScheme Manual]
Related Courses:
[CSC151.02 2008S (Davis)]
[CSC151 2007F (Rebelsky)]
[CSC151 2007S (Rebelsky)]
[CSCS151 2005S (Stone)]
Misc:
[SamR]
[DrFu]
[GIMP]
[DrScheme]
Back to Pairs and Pair Structures. On to Association Lists and Searching.
This outline is also available in PDF.
Held: Tuesday, 15 April 2008
Summary:
We begin our exploration of nonlist structures that one can build
with pairs (aka cons cells
). In particular, we consider a
recursive data structure typically called a tree. We then
explore how one writes recursive procedures that work with trees.
Related Pages:
Notes:
Overview:
cons
, car
, cdr
, null
,
and null?
.
(define recursivelistproc (lambda (lst) (if (null? lst) basecase (combine (car lst) (recursivelistproc (cdr lst))))))
(define recursivetreeproc (lambda (tree) (if (pair? tree) (combine (recursivetreeproc (car tree)) (recursivetreeproc (cdr tree))) (basecase tree))))
(define recursivetreeproc (lambda (tree) (if (pair? tree) (combine (recursivetreeproc (car tree)) (recursivetreeproc (cdr tree))) (basecase tree))))
color
.
Back to Pairs and Pair Structures. On to Association Lists and Searching.
[Skip to Body]
Primary:
[Front Door]
[Syllabus]

[Academic Honesty]
[Instructions]
Current:
[Outline]
[EBoard]
[Reading]
[Lab]
[Assignment]
Groupings:
[Assignments]
[EBoards]
[Examples]
[Exams]
[Handouts]
[Labs]
[Outlines]
[Projects]
[Readings]
References:
[AZ]
[Primary]
[Scheme Report (R5RS)]
[Scheme Reference]
[DrScheme Manual]
Related Courses:
[CSC151.02 2008S (Davis)]
[CSC151 2007F (Rebelsky)]
[CSC151 2007S (Rebelsky)]
[CSCS151 2005S (Stone)]
Misc:
[SamR]
[DrFu]
[GIMP]
[DrScheme]
Disclaimer:
I usually create these pages on the fly
, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Tue Apr 15 23:11:43 2008.
The source to the document was last modified on Thu Jan 17 16:44:18 2008.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2008S/Outlines/outline.41.html
.
You may wish to validate this document's HTML ; ;
Samuel A. Rebelsky, rebelsky@grinnell.eduhttp://creativecommons.org/licenses/bync/2.5/
or send a letter to Creative Commons, 543 Howard Street, 5th Floor,
San Francisco, California, 94105, USA.