### Question:
MyMapBinarySearchTree implements MyMapTreeBased<K, V> { @Override public int getMaxTreeDepth() { if (root == null) { return 0; } return depth(root); }  @Override void put(K key, V value); @Override void delete(K key); @Override V get(K key); @Override int size(); @Override int getMaxTreeDepth();  }### Answer:
@Test public void testDepthZero() { assertEquals(0, map.getMaxTreeDepth()); }