Hi everyone!

I recently implemented 2-3 tree, a balanced tree data structure. The key feature of this tree is, that all the leaves are at the same depth. The implementation is avaliable here: GitHub

Features

The current implementation supports insert() operation only.

Experiments

Two kinds of experiments were conducted. 1 million elements were inserted to a 2-3 tree, (1) in the ascending order and (2) in a random order.

(1) in the ascending order: http://ideone.com/62Seqz

(2) in a random order: http://ideone.com/6DHM21

Conclusion

References

The code is available here: https://github.com/koba-e964/contest/blob/61af81645a9c1287e3302642696f4fb5e5db47fb/comm/TwoThreeTree.rs
http://ideone.com/62Seqz
http://ideone.com/6DHM21

The implementation was done with the aid of this slide: https://www.slideshare.net/sandpoonia/23-tree