# Leetcode 145 - Binary tree postorder traversal

Given the root of a binary tree, return the postorder traversal of its nodes’ values.
Example

Iterative:

Recursive