Java22 [Java] 108. Convert Sorted Array to Binary Search Tree 문제 설명 : 1차원 int 배열을 활용해 height-balanced BST를 구현하는 문제 public TreeNode sortedArrayToBST(int[] nums) { return createTree(nums, 0, nums.length - 1); } private TreeNode createTree(int[] nums, int left, int right) { if (left > right) { return null; } int mid = (right + left) / 2; TreeNode root = new TreeNode(nums[mid]); root.left = createTree(nums, left, mid - 1); root.right = createTree(nums, mid + 1.. 2023. 6. 13. [Java] 104. Maximum Depth of Binary Tree 문제 설명 : Tree 구조의 Depth를 구하는 문제이다. /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */ class Solution { public int maxDepth(TreeNode root) { int count = 0; re.. 2023. 6. 13. [Java] 101. Symmetric Tree 문제 설명 : TreeNode가 주어지고, 해당 Tree가 좌우 대칭인지 확인하는 문제이다. /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */ class Solution { public boolean isSymmetric(TreeNode .. 2023. 6. 12. [Java] 100. Same Tree 문제 설명 : 두 TreeNode가 같은지 확인하는 문제이다. /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */ class Solution { public boolean isSameTree(TreeNode p, TreeNode q) { i.. 2023. 6. 12. 이전 1 2 3 4 ··· 6 다음
