반응형 Computer/Algorithm88 LeetCode - Binary Tree Postorder Traversal 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] Example 2: Input: root = [] Output: [] Example 3: Input: root = [1] Output: [1] Constraints: The number of the nodes in the tree is in the range [0, 100]. -100 root)를 풀이하였다. /** * Example: * var ti = TreeNode(5) * var v = ti.`val` * Definition for a binary t.. 2022. 9. 30. 이전 1 ··· 22 23 24 25 26 27 28 ··· 88 다음 반응형
