#leet_code#algorithm#medium_level#java#array#tree#depth_first_search#dfs[LeetCode] #105. Construct Binary Tree from Preorder and Inorder Traversal전위 순회, 중위 순회 값을 바탕으로 이진 트리를 구해봅니다.
![[LeetCode] #105. Construct Binary Tree from Preorder and Inorder Traversal cover image](/static/2ec0ede8ee2d9260970a53f04a04b8c3/7592a/cover.webp)