def rotate_right(alist):
    alist.insert(0, alist.pop())

#=================== Tests ========================
Return a post-order iterator for the tree.
dataset/ETHPy150Open manahl/PythonTrainingExercises/Beginers/ListsTuples/solutions.py/rotate_right--crossover with--dataset/ETHPy150Open ctxis/canape/CANAPE.Scripting/Lib/lib2to3/pytree.py/Leaf.post_order