c# coding question you need to create code which insert, Traverse (you only need one traversal),Find (note that in the splay tree Find puts the found node at the root)

FindAndDelete (this should search for a specific entry, if it exists delete it and then properly fix the tree) for

Red Black Tree

A 2-3-4 Tree.

Its up to you to write test cases to show that the trees are working properly for small numbers of inputs (less than 20 elements is fine).

You will likely need to make several methods which make this work (rotations for example), show tests for each of those as well.