C# Implementations of various Data Structures and Algorithms
- Splay Tree - a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again.
- Trie - an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings.
- 0/1 Knapsack Problem - Given a set of items, each with a weight and a value, determine which items to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.