Need this done by Nov 15
it need to be done in c programming language
Implement the following routines for a binary search tree: Insert a key into a binary search
tree
• Search for a query key value, and print an appropriate message
• Find the minimum key value
• Find the maximum key value
• Find a median key value
• Find the node containing the successor of a given key value
• Find the node containing the predecessor of a given key value
• A routine that takes two keys low and high and prints all elements of the tree that are in the range specified by low and high, inclusive of the end-points of the range.
i can do in 1 day.i can do in 1 day.i can do in 1 day.i can do in 1 day.i can do in 1 day.i can do in 1 day.i can do in 1 day.i can do in 1 day.i can do in 1 day.i can do in 1 day.i can do in 1 day.i can do in 1 day.i can do in 1 day.