Trial of the Conqueror

Evenvalue, the king of the even numbers has now set out to conquer the leaves of a rooted tree. The tree has $N$ nodes (numbered from $1$ to $N$) and is rooted at node $1$, which Evenvalue is currently on. In one move, he can do the following - - If the current node $U$ is a leaf, consider it conquered, choose $X$ such that $1 \le X \le K$, and move to the $X^{th}$ ancestor of $U$ (if it exists