Write a program to implement a binary search tree (BST) having the following functionalities. a. BSTInsert(): This function adds a given item to the BST. If the item already exists in the BST then it will not insert the ITEM anymore. b. BSTSearch(): This function finds the location of a given item in the BST. The function also returns the parent location of the node containing the item. c. BSTInorderStack(): This function finds the Inorder traversal sequence of a BST using stack. You are not supposed to use a recursive implementation of Inorder traversal. d. BSTDelete(): Deletes the nodes. (Consider all the cases of nodes with degrees 0, 1, and 2). e. BST_Successor(): finds the inorder successor of a node. f. BST_Predecessor(): finds the inorder predecessor of the node. g. BST_Findmin(): find the minimum element in a tree. h. BST_findmax(): find the maximum element in a tree.

AlSO EXPLAIN THE CODE PROPERLY AND DEMONSTRATE HOW TO RUN THE CODE

C language