Java (a,b) Tree Implementation
A (a,b) Tree implementation in Java.
What the Hell is an (a,b) tree
An (a,b) tree is a tree with:
- All of the leaves on the same depth
- 2<=a <=(b+1)/2
- Each internal node except the root has atlease a and at most b children
- The root has at most b children
Disclaimer
I wrote this one night during finals in college after alot of sleep deprivation- but I'm pretty sure it works.