docs: static int getRightMostLeafUnderNode(int nodeOrder, int depth) {
          if (isLeaf(nodeOrder, depth)) {
              return nodeOrder;
          }
  
          int levelOfNode = getLevelOfNode(nodeOrder);
          int distanceFromLeafLevel = depth - levelOfNode - 1;
          int leftMostLeafUnderNode = getLeftMostLeafUnderNode(nodeOrder, depth);
          int leavesOfSubtreeUnderNode = getNodesOnLevel(distanceFromLeafLevel);
  
          return leftMostLeafUnderNode + leavesOfSubtreeUnderNode - 1;
      }