In C# Language, create an AVL Tree, Red Black Tree, Splay Tree that does the following: Include with main program and testing f possible) 1. Insert element 2. Traverse (one traversal) 3. Find (note that in the splay tree "Find" puts the found node at the root) In C# Language, create an AVL Tree, Red Black Tree, Splay Tree that does the following: Include with main program and testing f possible) 1. Insert element 2. Traverse (one traversal) 3. Find (note that in the splay tree "Find" puts the found node at the root)