Home /
Expert Answers /
Computer Science /
uses-racket-with-plait-language-thanks-the-following-tree-datatype-implements-a-binary-tree-with-pa297
(Solved): Uses racket with plait language. Thanks. The following Tree datatype implements a binary tree with ...
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 big-leaves?, which takes a tree and returns \#t if every leaf is bigger than the sum of numbers in the path of nodes from the root that reaches the leaf. Examples: (big-leaves? (node 5 (leaf 6 ) (leaf 7))) should produce \#t, while (big- leaves? (node 5 (node 2 (leaf 8 ) (leaf 6 )) (leaf 7 ))) should produce \#f (since 6 is smaller than 5 plus 2 ).