docs: static int getLeftMostLeafUnderNode(int nodeOrder, int depth) {
          if (isLeaf(nodeOrder, depth)) {
              return nodeOrder;
          }
  
          int leafLevel = depth - 1;
          int levelOfNode = getLevelOfNode(nodeOrder);
          int distanceFromLeafLevel = depth - levelOfNode - 1;
          int leftMostNodeOrderOnLevel = getLeftMostNodeOrderOnLevel(levelOfNode);
          int relativeLevelOrder = nodeOrder - leftMostNodeOrderOnLevel;
          int leftMostLeaf = getLeftMostNodeOrderOnLevel(leafLevel);
  
          return leftMostLeaf + (2 << distanceFromLeafLevel - 1) * relativeLevelOrder;
      }