I am trying to get a binary search tree to balance, and I know why it's not working, but I don't know how to fix it.
I balance directly in the insert method.
I put some slash to note where the balancing should happen.
Like this the code is not working:
I prefer to focus on the impossible, because about the possible we already know too much.
Code without tests simply doesn’t exist!
Code is how we tell our colleagues how we feel about them.