B-tree is a tree data structure that keeps data sorted and support search, sequential access, insertions, and deletions in logarithmic time. If the data is not able to store in main memory, it store in the secondary memory.

The red-black tree is a binary search tree with color information. The color can be either red or black and it helps to balance the tree. The red-black tree has a complex implementation. The red-black binary search tree is an efficient data structure for maintaining the balanced binary search.

A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. The splay tree has good performance during the average case and uses small memory compare than another tree.

An AVL tree is another self-balanced binary search tree. The heights of the two child subtrees of any node differ by at most one; otherwise, rebalancing is done to restore this property. The AVL tree maintains an extra attribute in each node to balance the height.