LeetCode: 145 Binary Tree Postorder Traversal
0145 Binary Tree Postorder TraversalProblem DescriptionGiven the root of a binary tree, return the postorder traversal of its nodes' values.ExampleInput: root = [1,null,2,3] Output: [3,2,1]SolutionPle
0145 Binary Tree Postorder TraversalProblem DescriptionGiven the root of a binary tree, return the postorder traversal of its nodes' values.ExampleInput: root = [1,null,2,3] Output: [3,2,1]SolutionPle