I need explanations to question c and d$.$ I believe question d requires a different type of code implementation snippet.

Questions

Consider the following dataset as a Binary Search Tree dataset.

$\{14,17,11,7,53,4,13,12,8,60,19,16,20\}$

a: Draw the Binary Search tree from the dataset $(2\mathrm{.}5$ pts$)$

b: Delete Node $14$ and draw the new tree and mention which case

you used for deletion. $(2\mathrm{.}5$ pts$)$

c: What will the array size of this current dataset and which position

the values will be stored $(2\mathrm{.}5$pts$)$

d: what will be the link list implementation how the nodes will be

saved of this current dataset $(2\mathrm{.}5$ pts $).$