• Given a integer aDepth, returns a tree that is constituted of all the integers from 1 (at the root) to 2^(aDepth+1) - 1. The integers are ordered depth by depth, namely 1 at depth 0, 2 to 3 at depth 1, 4 to 7 at depth 2 and so on.

    Parameters

    • aDepth: number

      the depth of the tree

    Returns Tree<number>

    the cloned tree