A$[]=\{$A$,$ B $,$ C$,$ D $,$ E$,$ F $,$G $,$H $\}(8$ elements$)$

The task is to write a C$++$ program where the user constructs a balanced heap tree using the

provided CHAR array. The program is expected to implement a generic balanced heap tree

code, leveraging concepts from the course materials.

The command line interface should offer $4$ options to the user:

$1.$ Insertion

$2.$ Deletion

$3.$ Display

$4.$ Exit

The program should allow the user to perform insertion and deletion operations on the given input

array. After each successful insertion or deletion, the program should display the updated tree.

Implementing the display functionality is considered a bonus; it can either print with slashes or

simply display the parent and children as drawn on the board in the command line.