Do a recursive get over the keys of nested dictionaries

rget.py

# I always have problems with the names, please help me :)

def rget(dictionary, *args):
    '''Recursive `.get()` function.

    Do a recursive get over the keys of nested dictionaries.

    >>> things = {'a': {'b': {'c': 'd'}}}
    >>> rget(things, 'a', 'b', 'c')
    'd'

    >>> rget(things, 'a', 'b')
    {'c': 'd'}

    >>> rget(things, 'a')
    {'b': {'c': 'd'}}

    >>> rget(things, 'a', 'b', 'c', 'd')
    >>> rget(things, 'fake_key')
    >>> rget(things, 'a', 'fake_key')
    '''
    to_be_returned = None

    if args[1:]:
        to_be_returned = rget(dictionary.get(args[0]), *args[1:])
    elif args[0:] and isinstance(dictionary, dict):
        to_be_returned = dictionary.get(args[0])

    return to_be_returned

If you want it to return None if it can't find the key or if it tries to access a keys of something that's not a dict, I'd just put the reduce in a try block.

FTR because we've already talked about this by chat.

This is exactly what I'm trying to avoid, the need of use try-except blocks or nested ifs.