Computer Science > STUDY GUIDE > University of British Columbia - CPSC 110lab-10 solution cpsc 110. (All)
University of British Columbia - CPSC 110lab-10 solution cpsc 110.
Document Content and Description Below
;; On-ground students: Do the following as your pre-lab ;; Online students: Do the following as Task 1 ;; Using the data definitions below, design a function called can-encode? that ;; takes a lett ... er (NOT an entire word) and a Huffman code tree and ;;produces true ;; if that letter is reachable in the given tree, false otherwise. You should ;; not use any accumulators. As a reminder, we have asked you to blend the ;; backtracking template into your design. ;; We have provided the signature, purpose, stub, and some tests. (@htdd HTree) (define-struct htree (zero one)) ;; HTree is one of ;; - String ;; - (make-htree HTree HTree) ;; interp. A Huffman code tree where ;; a string s is an encoded value ;; (make-htree z o) is a tree with zero-branch z and one-branch o (define HT0 "A") [Show More]
Last updated: 3 years ago
Preview 1 out of 5 pages
Buy this document to get the full access instantly
Instant Download Access after purchase
Buy NowInstant download
We Accept:
Reviews( 0 )
$6.00
Can't find what you want? Try our AI powered Search
Document information
Connected school, study & course
About the document
Uploaded On
Mar 30, 2021
Number of pages
5
Written in
All
Additional information
This document has been written for:
Uploaded
Mar 30, 2021
Downloads
1
Views
246
