2 3 4 Tree in C#

This project is a basic C# 2 3 4 Tree (aka 2,4 Tree) implementation. It demonstrate a few simple operations of 2 3 4 Tree:

• Find
• Insert
• Delete (Todo)
• Inorder Traversal
• Preorder Traversal (Todo)
• Postorder Traversal (Todo)
• Levelorder Traversal (Todo)
• Min (Todo)
• Max (Todo)

Todo:

• More unit tests for demonstrations