code: public int depth() {
          if (isLeaf())
              return 1;
          return 1 + max(max(northWest.depth(), northEast.depth()), max(southWest.depth(), southEast.depth()));
      }
docs: The depth of the node
  @return the depth of the node