Not So Random Walks

Chef found a rooted tree with $N$ nodes. The nodes are labeled from $1$ to $N$. Node with label $1$ was marked as the root. $R$ is the adjacency list representing the tree, which includes only children, but not the parent of every node. Denote $K(i)$ as the number of children of the $i^{th}$ node. Denote $R(i, j)$ as the $j^{th}$ child of the $i^{th}$ node ($0 \leq j < K(i)$). Chef also found th