programming example write program to implement tree sort algorithm #include #include #include struct tree struct tree *leftint numstruct tree *rightvoid insert (struct tree **int)void inorder (struct tree *)void mainstruct tree * int arr[ ]int clrscrprintf("\ enter elements ")for( = ; < ; ++scanf("% "&arr[ ]) null printf ("\ the elements of the array are \nfor ( < ++printf ("% \ "arr[ ]for ( < ++insert (&tarr[ ]printf ("\ the sorted array is \ "inorder ( getchevoid insert (struct tree **tree_nodeint numif *tree_node =null *tree_node malloc (sizeof struct tree )*tree_node -left null *tree_node -num num *tree_node -right null else if num num insert &*tree_node -left )num else insert &*tree_node -right )num void inorder (struct tree *tree_node if tree_node !null inorder tree_node -left printf "% \ "tree_node -num inorder tree_node -right