B-Tree is a self balancing tree Data Structure that maintains sorted data. It also allows
- searches
- sequential access
- insertions
- deletions in logarithmic time.
It is commonly used in:
- databases
- file systems
For more information on this, you can visit this link