19 lines
359 B
19 lines
359 B
2 years ago
|
|
||
|
|
Exercise 2.67: Define an encoding tree and a
|
||
|
|
sample message:
|
||
|
|
|
||
|
|
|
||
|
|
(define sample-tree
|
||
|
|
(make-code-tree
|
||
|
|
(make-leaf 'A 4)
|
||
|
|
(make-code-tree
|
||
|
|
(make-leaf 'B 2)
|
||
|
|
(make-code-tree
|
||
|
|
(make-leaf 'D 1)
|
||
|
|
(make-leaf 'C 1)))))
|
||
|
|
|
||
|
|
(define sample-message
|
||
|
|
'(0 1 1 0 0 1 0 1 0 1 1 1 0))
|
||
|
|
|
||
|
|
Use the decode procedure to decode the message, and give the result.
|