1 (define (test-case actual expected)
10 (define (make-leaf symbol weight)
11 (list 'leaf symbol weight))
12 (define (leaf? object)
13 (eq? (car object) 'leaf))
14 (define (symbol-leaf x) (cadr x))
15 (define (weight-leaf x) (caddr x))
17 (define (make-code-tree left right)
20 (append (symbols left) (symbols right))
21 (+ (weight left) (weight right))))
23 (define (left-branch tree) (car tree))
24 (define (right-branch tree) (cadr tree))
25 (define (symbols tree)
27 (list (symbol-leaf tree))
34 (define (decode bits tree)
35 (define (decode-1 bits current-branch)
39 (choose-branch (car bits) current-branch)))
40 (if (leaf? next-branch)
41 (cons (symbol-leaf next-branch)
42 (decode-1 (cdr bits) tree))
43 (decode-1 (cdr bits) next-branch)))))
45 (define (choose-branch bit branch)
46 (cond ((= bit 0) (left-branch branch))
47 ((= bit 1) (right-branch branch))
48 (else (error "bad bit -- CHOOSE-BRANCH" bit))))
50 (define (adjoin-set x set)
51 (cond ((null? set) (list x))
52 ((< (weight x) (weight (car set))) (cons x set))
54 (adjoin-set x (cdr set))))))
55 (define (make-leaf-set pairs)
58 (let ((pair (car pairs)))
59 (adjoin-set (make-leaf (car pair)
61 (make-leaf-set (cdr pairs))))))
63 ;; Exercise 2.67. Define an encoding tree and a sample message:
66 (make-code-tree (make-leaf 'A 4)
69 (make-code-tree (make-leaf 'D 1)
72 (define sample-message '(0 1 1 0 0 1 0 1 0 1 1 1 0))
73 (test-case (decode sample-message sample-tree) '(A D A B B C A))