Question: Scheme. Hello I am trying to rewrite this function to be tail recursive. (define (decode bits tree) (define (decode-1 bits current-branch) (if (null? bits) '()
Scheme.
Hello I am trying to rewrite this function to be tail recursive.
(define (decode bits tree) (define (decode-1 bits current-branch) (if (null? bits) '() (let ((next-branch (choose-branch (car bits) current-branch))) (if (leaf? next-branch) (cons (symbol-leaf next-branch) (decode-1 (cdr bits) tree)) (decode-1 (cdr bits) next-branch))))) (decode-1 bits tree))
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
