Peak Array Paths

You are given an infinite tree (tree with an infinite height). Each node of the tree consists of a peak array. A **peak array** of length $N$ is an array which follows the conditions: - $A_i \geq 1$, $\forall$ $1 \leq i \leq N$. - $A_1 \lt A_2 \lt \dots \lt A_p \gt \dots \gt A_{N-1} \gt A_N$. - $A_p$ is the peak element of the array $(1 \leq p \leq N)$. For a parent node with the peak array $A