132. Binary Tree Postorder Traversal

Write a function solve that returns the postorder traversal of a binary tree (left, right, root).

Example:
Input: [1,null,2,3]
Output: [3,2,1]

Run this challenge interactively in Python or JavaScript when the app loads.