They want a program written in Haskell. The program is about a complete binary tree.

to Odtuckt "m MedAssets i 'd school Mar 443. https:/ Event tree Home work-(Til Tureng-fur ?O co x loads/AssignSimplerRelease.pdf Terminology Consider a rooted tree T. Let v be a vertex in T other than the root. The unique vertex u where there is a directed edge from u to v is called as the supervisor of v fie. parent). Vertices with the same supervisor are called peers. When a vertex other than the root is considered, the managers of it would be the vertices in the path from the root to this vertex, excluding the vertex itself and including the root (i.e, ancestors). . Similarly, the employees (i.e. descendants) of a vertex v are all of those vertices that have v as a If a vertex of a rooted tree does not have employees, it is called a low management (leat) and all the other manager vertices are called as internal management (internal vertices). Part 1-A Complete Binary Management Tree: part of this assignment, your program will use two lists of unique position names and two lists of floasts for position to establish a management tree. The first list of names and the first list of salaries are related to f nodes and other lists are related to the root and internal vertices. For simplicity, this management tree will be a salaries of each have the same depth". Please consider the imaginary management tree of the NEW UNIVERSITY i example. This example is used for the following sample run tree is a binary tree where all internal nodes have degree two and all leaves n Figure 1 as an Rector 5100,000 Dean Social Dean $70,000 70,000 Vice president Engineering Coordination Figurel: The New University Management 80 3 to Odtuckt "m MedAssets i 'd school Mar 443. https:/ Event tree Home work-(Til Tureng-fur ?O co x loads/AssignSimplerRelease.pdf Terminology Consider a rooted tree T. Let v be a vertex in T other than the root. The unique vertex u where there is a directed edge from u to v is called as the supervisor of v fie. parent). Vertices with the same supervisor are called peers. When a vertex other than the root is considered, the managers of it would be the vertices in the path from the root to this vertex, excluding the vertex itself and including the root (i.e, ancestors). . Similarly, the employees (i.e. descendants) of a vertex v are all of those vertices that have v as a If a vertex of a rooted tree does not have employees, it is called a low management (leat) and all the other manager vertices are called as internal management (internal vertices). Part 1-A Complete Binary Management Tree: part of this assignment, your program will use two lists of unique position names and two lists of floasts for position to establish a management tree. The first list of names and the first list of salaries are related to f nodes and other lists are related to the root and internal vertices. For simplicity, this management tree will be a salaries of each have the same depth". Please consider the imaginary management tree of the NEW UNIVERSITY i example. This example is used for the following sample run tree is a binary tree where all internal nodes have degree two and all leaves n Figure 1 as an Rector 5100,000 Dean Social Dean $70,000 70,000 Vice president Engineering Coordination Figurel: The New University Management 80 3