lecture8 - H IERARCHICAL D ATA 8 GEORGE WANG...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: H IERARCHICAL D ATA 8 GEORGE WANG gswang.cs61a@gmail.com Department of Electrical Engineering and Computer Sciences University of California, Berkeley July 1, 2010 1 Sentences vs. Lists My TAs have strongly objected to the characterization I gave yesterday and so heres the final word on that. Lists are NOT sentences, and sentences are NOT lists. We should think about sentences as something completely different from lists. Specifically, we should think about sentences as being an ADT (abstract data type) that is implemented using lists, but doesnt have to be. We should always respect the abstraction barrier between sentences and lists, by using the sentence constructs ( sentence , every , keep , first , butfirst , etc) only on sentences, and using the list constructs ( list , car , cdr , cons , append , etc) only on lists. 2 Trees from Last Lecture 2.1 Mapping over Trees One thing we might want to do with a tree is create another tree, with the same shape as the original, but with each datum replaced by some function of the original. 2.1.1 Exercise: Generalize! Heres two examples. Generalize this into a pattern! (define (square-tree tree) (make-tree (square (datum tree)) (map (lambda (tr) (square-tree tr)) (children tree) ))) 1 (define (cube-tree tree) (make-tree (cube (datum tree)) (map (lambda (tr) (cube-tree tr)) (children tree) ))) (define (treemap fn tree) Every tree node consists of a datum and some children. In the new tree, the datum corresponding to this node should be the result of applying fn to the datum of this node in the original tree. What about the children of the new node? There should be the same number of children as there are in the original node, and each new child should be the result of calling treemap on an original child. Since a forest is just a list, we can use map (not treemap !) to generate the new children. This is a remarkably simple and elegant procedure, especially considering the versatility of the data struc- tures it can handle (trees of many different sizes and shapes). 3 Mutual Recursion Pay attention to the strange sort of recursion in this procedure. Treemap does not actually call itself! Treemap calls map , giving it a function that in turn calls treemap . The result is that each call to treemap may give rise to any number of recursive calls, via map : one call for every child of this node....
View Full Document

This note was uploaded on 08/14/2010 for the course EECS 61A taught by Professor Harvey during the Summer '08 term at University of California, Berkeley.

Page1 / 6

lecture8 - H IERARCHICAL D ATA 8 GEORGE WANG...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online