I have some exercises for my hw about Algorithms and Data structure - Trees and Graphs. Please help me. Write by C/C++. Thanks

In this problem, we would like to provide a new structure for a binary search tree. The principles are as following: - Values are stored in the tree leaves (leaf nodes) - The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Subtrees must be a binary tree having 2 child nodes (terminal or internal node) Each internal node stores the largest value contained in its left subtree. The below figure shows an example for data 1,6,8,12,14,22,h ound up(log 6) 3, the binary tree will have n = 2-8 leaf nodes and the empty leafnodes are filled with the maximum in the array. 12 14 14 12 14 22 a) 2pts Propose an Abstract Data Type implementation for this binary tree b) 7pts-Implement this data structure in C/C++ with the necessary functions. c 1pts-Test and display the results using any order