Build a Binary Search Tree from the following values in the order given
a) 90 150 100 50 60 70 20 30 95 200 55 110 105 58 53 205 56 10 25 75.
b) Record balance values on this Binary Search Tree to check if it qualifies as an AVL tree.
c) Add 56 to the Tree from b) and rework the balance values after the addition. Make the necessary changes to revert back to an AVL Tree. Count the number of steps extra to addition operation.
d) Add 300 to the BS Tree from part c) and make sure that the tree remains an AVL Tree after addition.