Instructions

Provide implementation for a Binary Search Tree. This should include a TreeNode

class, which includes data $($which will be an int$),$ and left and right sub$-$nodes.

You must also implement a BinarySearchTree class, which includes the following:

An Insert method, which accepts an int and places it inside the tree in order, as

discussed in class

A Search method, accepts an int, and returns a bool indicating whether or not

the value was found

A Delete method, which accepts an int as parameter, and if it exists in the tree

removes it

Three traversal methods, one for each of the traversal orders $($in$-$order, pre$-$

order, post$-$order$)$

Your tree should also include a root, which is the root of the tree

C# please!