Pick any two tree data structures and compare and contrast them on at least three different points. How two different trees handle update/removal/insertion operations. Talk about the positives and negatives of how one algorithm may be worse in runtime, or how one may be significantly easier to implement with minimal trade off.

TYPE ANSWER AND UPLOAD IN CLEAR PHOTOS PLEASE