Task descr iption:

You need to implement the binary search tree of integers, including the functions:

 　　Insert: create a BST or insert an element to an existing tree

 　　Search: search one element, output whether it is in the tree

 　　Delete: remove one element the tree, using Search before removing

You also need to implement a driver/main function to demonstrate the functions and display all elements by using display function.

-Task descr iption:

You need to implement the binary search tree of integers, including the functions:

 　　Insert: create a BST or insert an element to an existing tree

 　　Search: search one element, output whether it is in the tree

 　　Delete: remove one element　the tree, using Search before removing

You also need to implement a driver/main function to demonstrate the functions and display all elements by using display function.