I'm 100% sure I accidentally implemented this wrong for two children nodes — should fix. Algorithm should be something like:

find node to delete
  if has two children
  _node := max in left subtree || min in right subtree
  swap values
  delete _node