内容 2.2 Hierarchical Data and the Closure Property · 114
练习 自检推理
Exercise 2.35: Redefine count-leaves from
2.2.2 as an accumulation:
(define (count-leaves t)
(accumulate ⟨??⟩ ⟨??⟩ (map ⟨??⟩ ⟨??⟩)))
练习 2.35:将第 2.2.2 节中的 count-leaves 重新定义为一个累积操作:
(define (count-leaves t)
(accumulate ⟨??⟩ ⟨??⟩ (map ⟨??⟩ ⟨??⟩)))
SICP source code scheme
(define (count-leaves t)
(accumulate ⟨??⟩ ⟨??⟩ (map ⟨??⟩ ⟨??⟩))) 我的笔记 自动保存