Mun: 8월 1주차 문제 풀이

08월/1주차/[LCD] Same Tree/Mun.java

@@ -0,0 +1,42 @@
+/**
+ * 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;
+ *     }
+ * }
+ */
+import java.util.*;
+class Solution {
+    public boolean isSameTree(TreeNode p, TreeNode q) {
+        Queue<TreeNode> pque = new LinkedList<>();
+        Queue<TreeNode> qque = new LinkedList<>();
+        pque.add(p);
+        qque.add(q);
+        while(!pque.isEmpty() && !qque.isEmpty()) {
+            TreeNode pn = pque.poll();
+            TreeNode qn = qque.poll();
+            if(pn == null && qn != null || pn != null && qn == null) {
+                return false;
+            }
+            if(pn != null && qn != null){
+                if (pn.val != qn.val){
+                    return false;
+                }else{
+                    pque.add(pn.left);
+                    pque.add(pn.right);
+                    qque.add(qn.left);
+                    qque.add(qn.right);
+                }
+            }
+        }
+        return true;
+    }
+}

08월/1주차/[LCD] Symmetric Tree/Mun.java

@@ -0,0 +1,45 @@
+/**
+ * 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;
+ *     }
+ * }
+ */
+import java.util.*;
+
+class Solution {
+    public boolean isSymmetric(TreeNode root) {
+        if(root == null) {
+            return true;
+        }
+        Queue<TreeNode> que = new LinkedList<>();
+        que.add(root.left);
+        que.add(root.right);
+        while(!que.isEmpty()){
+            TreeNode left = que.poll();
+            TreeNode right = que.poll();
+            if(left == null && right != null || left != null && right == null) {
+                return false;
+            }
+            if(left != null && right != null){
+                if (left.val != right.val){
+                    return false;
+                }else{
+                    que.add(left.left);
+                    que.add(right.right);
+                    que.add(left.right);
+                    que.add(right.left);
+                }
+            }
+        }
+        return true;
+    }
+}