A implementation of the composite pattern similar to a class that would be used for constructing a binary search tree. Better, more detailed implementations are known as red-black or AVL trees.
Reduces complexity by treating objects consistently, as opposed to having different methods and properties for each collection
Any modification method of a collection would be the same as modifying the container
Click the download button for Composite.cs...