Design, implement, and test a "pointer$-$based Binary Search Tree $($BST$)"$ storing integer

values $($search key$).$ In this BST$,$ nodes are allocated dinamically. The standard BST

operations should be provided, excluding the "deletion by key" operation $($not required$).$

This BST should be designed to allow the configuration of a custom integer$-$comparison

function using pointers to functions. ${?}^{12}$

a The "main" function, supporting command line arguments: a list of integer values, each

separated by a space, to be automatically inserted in the BST at startup $(5+5$ points$).$

b Three integer$-$comparison functions $($prototype "int f$($int $a,$ int $b)"),$ all accepting $2$ integer

values in input and all returning $1$ integer value in output $(0$ means $a=b,+1$ means $a>b,$

and $-1$ means ${?}^{34}$