A$[]=\{10\mathrm{.}00,20\mathrm{.}00,30\mathrm{.}00,40\mathrm{.}00,50\mathrm{.}00,60\mathrm{.}00,70\mathrm{.}00,80\mathrm{.}00,90\mathrm{.}00,100\mathrm{.}00\}$

You are required to create a complete binary tree $($BT$)$

$($balanced$)$ using a class structure in $C++.$ A sample

command line output with float values is on the right.

This non$-$generic binary tree $($BT$)$ should contain $10$

elements as seen above A$[].$ The elements should be

placed in appropriate positions within the tree as shown

in the given diagram. The graph should strictly be like

that of the graph seen on the right$-$hand side which is a

complete BT$.$

Requirements:

Use classes, do not use structs.

The tree is NOT a Binary Search Tree.

Use and benefit from the codes given in the course.

The binary tree should be complete, meaning every level should be filled, except possibly for the last level, which should be filled from left to right.

It will be like ReadTree in the lesson, you will create a complete binary tree recursively.

$/$ and $\backslash$ values are important. $$MPORTANT NOTE: THE OUTPUT OF THE CODE MUST BE SIMILAR TO THE IMAGE I ADDED. THE RIGHT AND LEFT BRANCHES THAT WILL BE CREATED WITH THE TREE $/\backslash$ SLASH SIGNS IN THE OUTPUT ARE THE VALUES THAT WILL BE DISPLAYED WITH THESE SIGNS IF A$[]=\{10\mathrm{.}00,20\mathrm{.}00,30\mathrm{.}00,40\mathrm{.}00,50\mathrm{.}00,60\mathrm{.}00,70\mathrm{.}00,80\mathrm{.}00,90\mathrm{.}00,100\mathrm{.}00\}$