* Data Structures and Algorithms using Java*

The array implementation is used in the coding of a Binary Search Tree structure. Calculate the structure's density assuming that it contains 200 nodes and:

a. Left balanced and each node contains 10 bytes of information.

b. Skewed to the right and each node contains 10 bytes of information.

c. Left balanced and each node contains 300 bytes of information.

d. Skewed to the right and each node contains 300 bytes of information.