* @brief Find the KTH largest value (internal method) * @param x Query the subtree of node x (Usually x=root) * @param k The queried rank * @return The element ranked number k */
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected