Node<K, V> removeInternalByKey(Object key) {
    Node<K, V> node = findByObject(key);
    if (node != null) {
      removeInternal(node, true);
    }
    return node;
  }
Removes {@code node} from this tree, rearranging the tree's structure as
necessary.

@param unlink true to also unlink this node from the iteration linked list.
lottie/src/main/java/com/airbnb/lottie/parser/moshi/LinkedHashTreeMap.java