implement binary indexed tree sticking to existing library style and objects

implement jump search algorithm for array container of library

implement matrix data structure and operations can performed on it.

Hello. I have seen your implementation of splay tree data structure. I want to propose quiet different data structure - splay tree with implicit key (not sure about naming). It doesn't support finding elements by key. Instead, it allows to emulate sequence of elements and supports concatenating, splitting and reversing with log(n) complexity in average.
For better explanation refer to this post.
You can find my implementation here.
It is written for c++14 and with Google style guide. I can fix it and create PR if you are interested.

Implement ternary search algorithm for array container of library

make changes in library so as to reduce memory leaks.

For a sample class implement Student class in student.h. All the containers must have tests with this class as classtype of template.

implement trie data structure

implement container class for bag data structure

add container class for disjoint set data structure