1.Write a class For implementing a simple binary search tree capable of storing numbers. The class should have member functions: void insert (double x) bool search(double x) void inorder (vector & v ) The insert function should not use recursion directly, or indirectly by calling a recursive function. The search function should work by calling a private recursive member function bool search (double x, BtreeNode *t) The inorder function is passed an initially empty vector v: it fills v with the inorder list of numbers stored in the binary search tree. Demonstrate the operation of the class using a suitable driver program

2. Modify the binary search tree to add a member function int size() that returns the number of items (nodes ) stored in the tree. Demonstrate the correctness of the new member function with a suitable driver program

PLEASE WRITE THEM BOTH AS SEPERATE CODES, I need the original as well as after it has been modified. Thank you so much in advance!