In this project, you will implement a self-balancing (or self-unbalancing) binary search tree called a Sequoia. The balancing rules and algorithms for insertion and deletion in a Sequoia are described in the project PDF:

In this project, you will develop code for a binary search tree variant called a Sequoia. Specifically,

you will need to implement member functions for two classes, Sequoia and SequoiaNode. Just like

a BST, Sequoia is the main class and represents the tree as a whole, while SequoiaNode represents

a single node in the tree