[N-0] minor refactor

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_100.java

@@ -4,6 +4,7 @@
 
 /**
  * 100. Same Tree
+ *
  * Given two binary trees, write a function to check if they are equal or not.
  * Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
  */

src/main/java/com/fishercoder/solutions/_235.java

@@ -4,6 +4,7 @@
 
 /**
  * 235. Lowest Common Ancestor of a Binary Search Tree
+ *
  * Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.
  * 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

src/main/java/com/fishercoder/solutions/_236.java

@@ -4,6 +4,7 @@
 
 /**
  * 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