Question: Haskell: Explain e) Data Types: Using the following defininition Idata Tree = Leaf Int Node Tree Int Tree First, give a non-trivial example of a

Haskell: Explain

e) Data Types: Using the following defininition Idata Tree = Leaf Int Node Tree Int Tree First, give a non-trivial example of a tree with type Tree. Secondly, define a function that decides whether a tree is balanced (see definition below). Is the tree that you have given as an example balanced? [Def: We call a tree balanced if the differences of the heights of left subtrec and right subtree at each node differ at most by 1.] [6 marks]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

WHAT KIND OF MORE INFORMATION DO YOU WANT? THIS IS ALL THE INFORMATION I HAVE. module Main where import Test.HUnit import System.Exit -- *** Read Chapters 8 and 16 *** data Tree2 a b = Leaf2 a |...

Problem 7. (30 points) Make sure you read Chapter 16 before attempting this problem.] Chapter 16. Exercise 6, page 247. This problem has two parts. Given the following data type data Tree = Leaf Int...

1. Introduction to Computer Architecture concepts; The MIPS R2000 architecture allows for up to four external coprocessors. Our local systems arIPS external coprocessors are used by describing, in...

io (a) Give the general formula for estimating transition probabilities from training data. Provide the full transition matrix A for this HMM based on the training data shown. [6 marks] (b) Give the...

write haskell code for the following Exercise 3. Binary trees 16+5 = 21 points The following data type defines binary trees holding integers, which can be a leaf with a value or an internal node with...

PLEASE HELP!! this is a Haskell programming assignment! I've attached the given skeleton at the very bottom. Part 1. Recursive functions, higher order functions [Read Chapter 7] Problem 1. This...

can someone solve this Modern workstations typically have memory systems that incorporate two or three levels of caching. Explain why they are designed like this. [4 marks] In order to investigate...

Purpose and Goal: We have discussed binary trees (BTs) and you will utilize them in a rough implementation of a famous compression algorithm: Huffman Compression. In this program you will utilize a...

Instructions All the questions refer to Haskell programs. Submit the answers that are programs in a *.hs file. For the written questions, you can include them in the *.hs file as as {- multi-line...

The Game of 20 Questions: In this assignment you will implement a yeso guessing game called "20 Questions." Each round of the game begins by you (the human player) thinking of an object. The computer...

On June 7, 2013, Cheng and Morales, two recent graduates of Upper State University, formed a computer consulting firm. Cheng contributed an extensive, up-to-date computer installation, valued at...

The graphs of two functions y = f(x) are shown in Figure 1 below. For each of them, sketch a qualitatively accurate graphs of the first derivative f(x) and the second derivative f(x) from the graphs...

Your client Carlie has owned a variable annuity for many years. She appreciated the ability to allocate funds between stocks and bonds, but would like to get into growth oriented investments. What...

You know the following information about State Bank ( in $ mln ) : Accumulated depreciation $ 3 0 . 7 6 , Net loans $ 6 3 8 . 0 4 9 , Fed funds purchased and repurchase agreements $ 1 4 3 . 4 3 9 ,...

Design a survey feedback intervention program, and use this to promote retention of key organizational personnel. page 445

Discuss the significance of process issues such as communication in compensation management. page 474

Discuss how pay influences individual employees, and describe three theories that explain the effect of compensation on individuals. page 498