w that decidable languages are closed under the following operations: a. Set Difference b. Kl

Program in C++

USING C++, Implement a TEMPLATED Binary Search Tree (RECURSIVE) class, that is minimal & complete. Provide the following recursive operations: Insert, Delete tree, Search, inOrder traversal, preOrder traversal, postOrder traversal. Methods essential for correct operation of tree in terms of managing memory must be provided. Any additional methods can be added. Use function pointers in the traversal routines. cannot use std::function (or any other similar routine from std namespace. Test BST to make sure all methods work. In particular make sure that you can pass the tree to other routines by value, const reference and reference. Check that data values are as expected on pass/return to/from routines. Do not use GUI interaction.   Input/Output (user): Sample output formats shown below use made up data for the year 1905. Menu options are: The average wind speed and sample standard deviation for this wind speed given a specified month and year. (print on screen only) Eg: January…

I want to know what am i doing wrong in HASKELL code below its regsrding functors