Python Simple Postorder
\nclass Solution(object):\n    def delNodes(self, root, to_delete):\n\t\n        def post_order(node, res):\n            if node:\n                post_order(no
```\nclass Solution(object):\n    def delNodes(self, root, to_delete):\n\t\n        def post_order(node, res):\n            if node:\n                post_order(node.left, res)\n                post_order(node.right, res)\n                \n                if node.left and node.left.val in to_delete_set:\n                    node.left = None\n                    \n                if node.right and node.right.val in to_delete_set:\n                    node.right = None\n                    \n                if node.val in to_delete_set:\n                    if node.left:\n                        res.append(node.left)\n                    if node.right:\n                        res.append(node.right)\n                \n        res = []\n        to_delete_set = set(to_delete)\n\n        post_order(root, res)\n\n        if root.val not in to_delete_set:\n            res.append(root)\n\n        return res\n```
[]