what has mentioned above present all operations about BST(binary search tree) this part includes: void midOrderTraverse(BinaryTreeNode* root) void InsertDataToBinarySearchTreeCycleVersion(BinaryTreeNode** r, int data) void InsertDataToBstRecursionVersion(BinaryTreeNode** r, int data) BinaryTreeNode* Search_BinarySearchTree_CycleVersion(BinaryTreeNode* root,int find) BinaryTreeNode* Search_BinarySearchTree_RecursionVersion(BinaryTreeNode* root, int find) BinaryTreeNode* getMinNode_From_BinarySearchTree(BinaryTreeNode* root) BinaryTreeNode* getMaxNode_From_BinarySearchTree(BinaryTreeNode* root) BinaryTreeNode* getFatherNode_of_BST(BinaryTreeNode* root, BinaryTreeNode* child) void deleteNode_Of_BinarySearchTree(BinaryTreeNode** r, BinaryTreeNode* pointToDelete) void destroy_BinarySearchTree(BinaryTreeNode* r)