JAVA_LeetCode 105_Construct Binary Tree from Preorder and Inorder Traversal

JAVA_LeetCode 105_Construct Binary Tree from Preorder and Inorder Traversal 풀이 class Solution { private Map inorderIndexMap; private int preorderIndex; // preorder 배열에서 다음 트리의 루트가 될 위치 public TreeNode buildTree(int[] preorder, int[] inorder) { inorderIndexMap = new HashMap(); for(int i = 0; i < inorder.length; i++) inorderIndexMap.put(inorder[i], i); // inorder 값 초기화 preorderIndex = 0; // 재귀 실행 return buildSubtree(preorder, 0, inorder.length - 1); } private TreeNode buildSubt...