Currently, RedBlack trees and AVL trees (in progress) are derived directly from a the Binary Search Tree object. However, they share some functionality (for instance, basic rotations), and could likely benefit from being abstracted behind something like a 'BalancedTree' object.
Currently, RedBlack trees and AVL trees (in progress) are derived directly from a the Binary Search Tree object. However, they share some functionality (for instance, basic rotations), and could likely benefit from being abstracted behind something like a 'BalancedTree' object.