solves leaf similar tree

Author: anishLearnsToCode

README.md

@@ -234,7 +234,7 @@
 | 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [![Java](assets/java.png)](src/LemonadeChange.java) |
 | 867 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [![Java](assets/java.png)](src/TransposeMatrix.java) |
 | 868 | [Binary Gap](https://leetcode.com/problems/binary-gap) | [![Java](assets/java.png)](src/BinaryGap.java) |
-| 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | |
+| 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | [![Java](assets/java.png)](src/LeafSimilarTrees.java) |
 | 874 | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | |
 | 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | |
 | 883 | [Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes) | |

src/LeafSimilarTrees.java

@@ -0,0 +1,26 @@
+import java.util.ArrayList;
+import java.util.List;
+
+public class LeafSimilarTrees {
+    public boolean leafSimilar(TreeNode root1, TreeNode root2) {
+        List<Integer> leafSequence1 = getLeafSequence(root1);
+        List<Integer> leafSequence2 = getLeafSequence(root2);
+        return leafSequence1.equals(leafSequence2);
+    }
+
+    private List<Integer> getLeafSequence(TreeNode root) {
+        List<Integer> result = new ArrayList<>();
+        getLeafSequence(root, result);
+        return result;
+    }
+
+    private void getLeafSequence(TreeNode root, List<Integer> leafNodes) {
+        if (root == null) return;
+        if (root.left == null && root.right == null) {
+            leafNodes.add(root.val);
+            return;
+        }
+        getLeafSequence(root.left, leafNodes);
+        getLeafSequence(root.right, leafNodes);
+    }
+}