Tree traversal - postorder

tree_traversal_postorder.py

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None

def postorder_traversal_recursive(root):
    result = []

    def recur(node):
        # base case
        if not node:
            return

        # traverse the left subtree
        recur(node.left)
        # traverse the right subtree
        recur(node.right)
        # visit node
        result.append(node.val)

    recur(root)
    return result