728x90
반응형
[LeetCode - Daily Challenge] 106. Construct Binary Tree from Inorder and Postorder Traversal

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given two integer arrays inorder and postorder where inorder is the inorder traversal of a binary tree and postorder is the postorder traversal of the same tree, construct and return the binary tree. Example 1: Input: inorder = [9,3,15,20,7], postorder = [9,15,7,20,3] Output: [3,9,20,null,null,15,7] Example 2: Input: inorder = [-1], postorder = [-1] Output: [..
Algorithm/LeetCode Daily Challenge 2021. 11. 24. 10:30
728x90
반응형
1