Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Please use plait in Racket The following Tree datatype implements a binary tree with a number in each node and leaf: (define-type Tree (leaf [val

Please use plait in Racket

The following Tree datatype implements a binary tree with a number in each node and leaf: (define-type Tree (leaf [val : Number]) (node [val : Number] [left : Tree] [right : Tree]))

Implement the function positive-trees?, which takes a list of trees and returns #t if every member of the list is a positive tree, where a positive tree is one whose numbers sum to a positive value.

Hint 1: This function takes a list, not a tree, so dont try to use the template for a tree function.

Example:

(test (positive-trees? (cons (leaf 6) empty)) #t)

(test (positive-trees? (cons (leaf -6) empty)) #f)

(test (positive-trees? (cons (node 1 (leaf 6) (leaf -6)) empty)) #t)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Systems For Advanced Applications 15th International Conference Dasfaa 2010 International Workshops Gdm Benchmarx Mcis Snsmw Diew Udm Tsukuba Japan April 2010 Revised Selected Papers Lncs 6193

Authors: Masatoshi Yoshikawa ,Xiaofeng Meng ,Takayuki Yumoto ,Qiang Ma ,Lifeng Sun ,Chiemi Watanabe

2010th Edition

3642145884, 978-3642145889

More Books

Students also viewed these Databases questions

Question

There is usually no way to work or on improve a person EQ

Answered: 1 week ago