Language: EN FI

Exercises > B-Tree

These exercises demonstrate the content of the ByTheMark service. These are meant for private individuals for learning data structures and algorithms. If you want to try out more content, you can register to the ByTheMark Personal free of charge.

Before attempting to solve the exercise, examine (possible several) model solutions in order to determine whether the B-Tree is a 2-3-tree or 2-3-4-tree, whether it employs top-down or bottom-up balancing, and whether the duplicates are inserted into the left or right branch from an equal key. After viewing the models solution, you have to reset the exercise. However, the new exercise applies the very same B-Tree than in the model solution before. Finally, insert the given keys into the initially empty B-Tree.


  Last modified Tue Mar 01 20:54:04 EET 2011