Define a BinaryTree class that contains a pointer that would point to a dynamic array of structures.
Each structure contains two fields, a data field and a balance-factor field.
Define a constructor that receives an array, creates a dynamic arrayof structures and initializes it.
Define a BalanceFactor() method to compute the balance-factors of all nodes and stores them in each node's balance-factor field.
Define ComputeBalance() to compute the balance-factor of an
Define Insert() method to insert a node into the tree.
Define Delete() method to delete a node from the tree.
Define TraversInOrder() to display the tree inorder.
As always, create several different examples and test your
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
use dev c++