Here’s my code. Still on “normal” but I’ll try to add balancing (and normalizing) before Sunday :)
weekly-challenge-binary-trees - Solution to Weekly Challenge #1 (https://medium.com/@jamis/weekly-programming-challenge…github.com
I would also like to refactor the code to avoid some of the duplication. The way the tree is traversed and updated are duplicated in ‘delete’, ‘insert’ and ‘includes?’.