Balanced Binary Search Trees

Implementation of some popular Balanced Binary Search Trees and Performance Comparison

Implementation

• AVL Tree

• Red Black Tree

• Splay Tree

• Treap

Performance Comparison

Here , N is the number of operations (insert/find/delete) .

You can find the generator here

Red Black Tree is surprisingly fastest despite its recursive implementation . Treap is slowest as expected with its high constant factor .