Self-Balancing Binary Search Trees Research. Creation of a primitive database implementation based on the SQL standard.

In this project, a study of Self-Balancing Binary Search Trees data structures was performed.
Binary search trees are trees that are able to maintain a balance of their height, which significantly speeds up operations.

The following Self-Balancing Binary Search Trees have been implemented:

• AVL tree
• B-tree
• Red-black tree
• Splay tree
• 2-3 tree

Detailed information about the project

Read more about the project on the wiki

Contributors

• Maksym Mykhasiuta
• Oleksii Mytnyk
• Serhii Matsyshyn
• Fedir Zhurba
• Bohdan Pelekh