updated

Author: Blooverh

LeetCode/Grind169/BinaryTrees/BalancedBinaryTree_110.java

@@ -0,0 +1,36 @@
+package Grind169.BinaryTrees;
+
+public class BalancedBinaryTree_110 {
+    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;
+        }
+    }
+    public static void main(String[] args) {
+        
+    }
+
+    private boolean result = true;
+
+    public boolean isBalanced(TreeNode root) {
+        maxDepth(root);
+        return result;
+    }
+
+    public int maxDepth(TreeNode root) {
+        if (root == null)
+            return 0;
+        int l = maxDepth(root.left);
+        int r = maxDepth(root.right);
+        if (Math.abs(l - r) > 1)
+            result = false;
+        return 1 + Math.max(l, r);
+    }
+}

LeetCode/Grind169/BinaryTrees/InvertBinaryTree_226.java

@@ -0,0 +1,37 @@
+package Grind169.BinaryTrees;
+
+public class InvertBinaryTree_226 {
+
+    
+    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;
+        }
+    }
+    public static void main(String[] args) {
+        
+    }
+
+    public static TreeNode invertTree(TreeNode root) {
+        TreeNode save= null;
+
+        while(root != null){
+            save= root.left;
+            root.left= root.right;
+            root.right= save;
+            invertTree(root.right);
+            invertTree(root.left);
+            return root;
+        }
+
+        return null;
+        
+    }
+}

LeetCode/Grind169/BinaryTrees/MaxDepthBinaryTree_104.java

@@ -0,0 +1,31 @@
+package Grind169.BinaryTrees;
+
+public class MaxDepthBinaryTree_104 {
+    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;
+        }
+    }
+
+    public static void main(String[] args) {
+        
+    }
+
+    public int maxDepth(TreeNode root) {
+        // Base Condition
+        if(root == null) return 0;
+        // Hypothesis
+        int left = maxDepth(root.left);
+        int right = maxDepth(root.right);
+        // Induction
+        return Math.max(left, right) + 1;
+    }
+
+}