refactor 236

fishercoder1534 · fishercoder1534 · commit dfc61e9d1ef7 · 2020-05-23T08:09:58.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_236.java b/src/main/java/com/fishercoder/solutions/_236.java
@@ -2,25 +2,6 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-/**
- * 236. Lowest Common Ancestor of a Binary Tree
- *
- * Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
- * According to the definition of LCA on Wikipedia:
- * “The lowest common ancestor is defined between two nodes v and w as the lowest node in T
- * that has both v and w as descendants (where we allow a node to be a descendant of itself).”
-
-           _______3______
-          /              \
-      ___5__          ___1__
-    /      \        /      \
-   6      _2       0       8
-  / \
- 7   4
-
- For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3.
- Another example is LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.*/
-
 public class _236 {
     public static class Solution1 {
 
