Binary tree, DP, DFS

binary_tree_dp_dfs.py

def binary_tree_dp_dfs(n, k=1, a=[1]):
    '''
    >>> for x in binary(3): print x
    [1, 2, 4]
    [1, 2, 5]
    [1, 3, 6]
    [1, 3, 7]
    '''
    if n == k:
        yield a
    else:
        for x in binary(n, k + 1, a + [a[-1] * 2]):
            yield x
        for x in binary(n, k + 1, a + [a[-1] * 2 + 1]):
            yield x