BTree in C#

This week I completed a BTree implementation which I’ve been working on. As verification of its efficiency over a standard data structure like List, I ran some numbers and plugged them into Google’s Graph API. The results illustrate a BTree order 4 attempting to find a span of 9000 keys over 50000 possibilities (as compared to List). The left (Y) axis represents time in milliseconds, and the bottom (X) axis represents number of keys searched.