def _walk(node: int, side: int):
    child = int(tree[node][side])
    child_size = 1
    idx = 0
    if (child > totcolcnt):
        idx = (child - totcolcnt)
        child_size = tree[idx][3]
    if (child_size > maxsize):
        return idx
    else:
        node_list.append(_get_leaves(tree, child, totcolcnt))
        return None
def _walk(node: int, side: int):
    child = int(tree[node][side])
    child_size = 1
    idx = 0
    if (child > totcolcnt):
        idx = (child - totcolcnt)
        child_size = tree[idx][3]
    if (child_size > maxsize):
        return idx
    else:
        node_list.append(_get_leaves(tree, child, totcolcnt))
        return None