Only use C++ Method for Binary Search Tree

I need Question 2 Solution. only Solve Question no 2.

Question No.1 [5 Marks] In this assignment, you will have to implement the basic functions needed to build and search binary search trees (abbreviated BST). Your implementation should be such that the nodes of the tree contain an integer and links (possibly null) to the left and right children of the node. 1. Binary Search Trees (BSTs) a. Draw the BST where the data value at each node is an integer and the values are entered in the following order: 36,22,10,44,42. b. Draw the BST after the following insertions have been done in the tree of part (a): 16,25,3,23,24 (there is no attempt at being tricky; parts (a) and (b) could be combined into a single one but we want you to check your work so that you don't make a silly mistake). c. Now draw the tree after deletions of 42,23 and 22 in this order. d. Write down the order on which the node values are reached when the BST of part (c) is traversed. (i) in inorder (ii) in postorder (iii) in preorder. e. What is the height of the tree of part (c)? Which nodes have maximal depth in the tree of part (c)? Question No.2 [5 Marks] Programming Assignment In this assignment you have to implement some basic C++ methods for BST's (with a little twist) and an iterator (i.e., a post-order sequencing). Specifically, the methods that you have to implement are: - insertordelete(item). If item is not in the tree, it is inserted in the tree. If item is already in the tree, it is deleted from the tree. - contains(item) returns true if item is in the tree, false otherwise. - size() returns the number of nodes in the tree. This method should run in O(1). - iteratorn returns an iterator for the BST. - print() prints the elements of the tree in in-order. one element per line. In this assignment you have to implement some basic C++ methods for BST's (with a little twist) and an iterator (i.e., a post-order sequencing). Specifically, the methods that you have to implement are: - insertordelete(item). If item is not in the tree, it is inserted in the tree. If item is already in the tree, it is deleted from the tree. - contains(item) returns true if item is in the tree, false otherwise. - size() returns the number of nodes in the tree. This method should run in O(1). - iterator0 returns an iterator for the BST. - print() prints the elements of the tree in in-order. one element per line