250x250
반응형
Notice
Recent Posts
Recent Comments
Link
목록후위탐색 (1)
N
(Leet Code c++)Binary Tree Postorder Traversal
145. 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] Example 4: Input: root = [1,2] Output: [2,1] Example 5: Input: root = [1,null,2] Output: [2,1] Constraints: The number of the nodes in the tr..
Leet Code 알고리즘
2021. 7. 19. 09:41