refactor 226

fishercoder1534 · fishercoder1534 · commit d8d6604ba70e · 2020-05-21T06:45:39.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_226.java b/src/main/java/com/fishercoder/solutions/_226.java
@@ -5,79 +5,55 @@
 import java.util.LinkedList;
 import java.util.Queue;
 
-/**
- * 226. Invert Binary Tree
-
-  Invert a binary tree.
-
-		 4
-	   /   \
-	  2     7
-	 / \   / \
-	1   3 6   9
-
-	to
-
-		 4
-	   /   \
-	  7     2
-	 / \   / \
-	9   6 3   1
-
-Trivia:
-This problem was inspired by this original tweet by Max Howell:
-Google: 90% of our engineers use the software you wrote (Homebrew),
- but you can�t invert a binary tree on a whiteboard so fuck off.
- */
 public class _226 {
 
-	public static class Solution1 {
-		public TreeNode invertTree(TreeNode root) {
-			if (root == null) {
-				return root;
-			}
-			Queue<TreeNode> q = new LinkedList();
-			q.offer(root);
-			while (!q.isEmpty()) {
-				TreeNode curr = q.poll();
-				TreeNode temp = curr.left;
-				curr.left = curr.right;
-				curr.right = temp;
-				if (curr.left != null) {
-					q.offer(curr.left);
-				}
-				if (curr.right != null) {
-					q.offer(curr.right);
-				}
-			}
-			return root;
-		}
-	}
-
-	public static class Solution2 {
-		public TreeNode invertTree(TreeNode root) {
-			if (root == null) {
-				return root;
-			}
-			TreeNode temp = root.left;
-			root.left = root.right;
-			root.right = temp;
-			invertTree(root.left);
-			invertTree(root.right);
-			return root;
-		}
-	}
-
-	public static class Solution3 {
-		//more concise version
-		public TreeNode invertTree(TreeNode root) {
-			if (root == null) {
-				return root;
-			}
-			TreeNode temp = root.left;
-			root.left = invertTree(root.right);
-			root.right = invertTree(temp);
-			return root;
-		}
-	}
+    public static class Solution1 {
+        public TreeNode invertTree(TreeNode root) {
+            if (root == null) {
+                return root;
+            }
+            Queue<TreeNode> q = new LinkedList();
+            q.offer(root);
+            while (!q.isEmpty()) {
+                TreeNode curr = q.poll();
+                TreeNode temp = curr.left;
+                curr.left = curr.right;
+                curr.right = temp;
+                if (curr.left != null) {
+                    q.offer(curr.left);
+                }
+                if (curr.right != null) {
+                    q.offer(curr.right);
+                }
+            }
+            return root;
+        }
+    }
+
+    public static class Solution2 {
+        public TreeNode invertTree(TreeNode root) {
+            if (root == null) {
+                return root;
+            }
+            TreeNode temp = root.left;
+            root.left = root.right;
+            root.right = temp;
+            invertTree(root.left);
+            invertTree(root.right);
+            return root;
+        }
+    }
+
+    public static class Solution3 {
+        //more concise version
+        public TreeNode invertTree(TreeNode root) {
+            if (root == null) {
+                return root;
+            }
+            TreeNode temp = root.left;
+            root.left = invertTree(root.right);
+            root.right = invertTree(temp);
+            return root;
+        }
+    }
 }
