Day 29: BST Insertion and Removal

Today I went over the algorithms for binary search tree insertions and removals, noting that the time complexity would be O(logn) if the binary search tree is balanced or O(n) in the worst case if the BST is left or right skewed (unbalanced) due to its height.