When I run the code these values should show me bond between father and child nodes in the output. Johny, Clark, George, Michael, Rihanna,

Alex, Ferguson, $$cardi$,$ Dzeko, Talisca $\}$

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

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

command line output with string 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. When I run the code these values should show me bond between father and child nodes in the output. When I run the code it should look like given picture.