Question Link : https://leetcode.com/problems/binary-tree-postorder-traversal/

Difficulty: Easy

Premium: False

Question

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

Input: root = [1,null,2,3] Output: [3,2,1] Explanation:

Example 2:

Input: root = [1,2,3,4,5,null …

Continue reading