Draw the flowchart of the algorithm that reorders the elements of an array of random integer values $$to create a binary search tree with minimum height. After the array is reordered, the elements will be added to the tree in their new order, starting with the first element, then $2$nd$,3$rd$,...,$ nth$.$ Implement in C language.

Sample array: $[15,24,83,45,65,21,101,58,41,7,27,33,18,1]$

Original tree:

$15$

$/\backslash$

$724$

$/\backslash$

$183$

$/\backslash$

$45101$

$/\backslash$

$2165$

$\backslash /$

$1858$

$/$

$41$

$/$

$27$

$\backslash$

$33$

Minimum BST:

$24$

$/\backslash$

$1541$

$/\backslash /\backslash$

$7182765$

$/\backslash /\backslash$

$1215883$

$\backslash$

$101$

$/$

$33$