USE C++ Assignment

Please, i need help with this short tasks.

Task 1: Please create Look-up () and Insert functions for Binary Search Tree examples in attached supplement (Attach Snipping Photos of Source Code Below) Optional Implement example 1. Build123() from attached supplement. A. by calling newNode() three times, and using three pointer variables B. by calling newNode() three times, and using only one pointer variable C. by calling insert() three times passing it the root pointer to build up the tree Task 2: Please Implement 2. size() -> Problem demonstrates simple binary tree traversal (Attach Snipping Photos of Source Code Below) Task 3: maxDepth(0) Given a binary tree, compute its "maxDepth" --the number of nodes along the longest path from the root node down to the farthest leaf node. The maxDepth of the empty tree is 0, the maxDepth of the tree on the first page is 3 int maxDepth(struct node* node) f