Postorder Traversal

Given the root of a binary tree, return the postorder traversal of its nodes. Postorder traversal visits left, right, root.

Examples
Input: [1,null,2,3]
Output: [null]
Hints

Postorder Traversal

Given the root of a binary tree, return the postorder traversal of its nodes. Postorder traversal visits left, right, root.