[SOLVED] Data Structure-Project 3 Balanced Binary Search Tree

Description

In our labs we have used unbalanced Binary Search Trees. In this project:

1. Pick two balanced binary search tree implementations (AVL, Red-Black, ScapeGoat, 2-3, AA, Splay, Treap, etc) and implement our interface.
2. Next research what situations each perform better or worse in. Namely:
   • Tell me the situation one exhibits better performance.
   • Tell me why you believe that is the case.
3. Then generate test cases show one performing better than the other. Generate a performance graph.

You may add functions to our Binary Tree implementation!