(Java) Create a subclass of BinaryTree whose nodes have fields for storing  preorder, post-order, and in-order numbers. Write methods preOrderNumber(),  inOrderNumber(), and postOrderNumbers() that assign these numbers correctly. These  methods should each run in O(n) time

- In class HashTable implement a hash table and consider the following:(i) Keys are integers (therefore also negative!) and should be stored in the tableint[] data.(ii) As a hash function take h(x) = (x · 701) mod 2000. The size of the table istherefore 2000. Be careful when computing the index of a negative key. Forexample, the index of the key x = −10 ish(−10) = (−7010) mod 2000 = (2000(−4) + 990) mod 2000 = 990.Hence, indices should be non-negative integers between 0 and 1999!(iii) Implement insert, which takes an integer and inserts it into a table. Themethod returns true, if the insertion is successful. If an element is already inthe table, the function insert should return false.(iv) Implement search, which takes an integer and finds it in the table. The methodreturns true, if the search is successful and false otherwise.(v) Implement delete, which takes an integer and deletes it form the table. Themethod returns true, if the deletion is successful and false otherwise.(vi)…

(In java) In this task, a binomial heap should be implemented. A binomial heap is implemented byan array with its elements being binomial trees: on the first place there is the binomial treeB0 with one element, on the second place there is the binomial tree B1 with two elements,on the third place there is the binomial tree B2 with four elements,. . . Each binomial treeis implemented recursively using the class BinomialNode. In this class there is nothing toimplement. Methods in this class are needed for the implementation of the methods in theclass BinomialHeap. More precisely, in the class BinomialHeap you should implement thefollowing methods:-> delMin, which deletes the minimal key from the binomial heap. The method returnstrue, if the minimal key is successfully deleted and false otherwise (if the binomialheap is empty).-> resizeArray, which extends the array. The method is needed, for example, whenyou find out that you need an extra place in your array when inserting new…

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…