993. Cousins in Binary Tree (easy)

DhananjayGore · DhananjayGore · commit 36c00914dee9 · 2022-04-22T21:31:36.000+05:30
diff --git a/dsa-trees/readme.md b/dsa-trees/readme.md
@@ -11,4 +11,5 @@ list of standard Tree problems which are solved in this repo with explaination
 * *[872. Leaf-Similar Trees (easy)](https://leetcode.com/problems/leaf-similar-trees/)*
 * *[257. Binary Tree Paths (easy)](https://leetcode.com/problems/binary-tree-paths/)*
 * *[404. Sum of Left Leaves (easy)](https://leetcode.com/problems/sum-of-left-leaves/)*
-* *[112. Path Sum (easy)](https://leetcode.com/problems/path-sum/)*
+* *[112. Path Sum (easy)](https://leetcode.com/problems/path-sum/)*
+* *[993. Cousins in Binary Tree (easy)](https://leetcode.com/problems/cousins-in-binary-tree/)*
diff --git a/dsa-trees/src/LC993_CousinsInBinaryTree.java b/dsa-trees/src/LC993_CousinsInBinaryTree.java
@@ -0,0 +1,41 @@
+/**
+ * 
+ */
+
+/**
+ * @author dhananjay
+ * @link : https://leetcode.com/problems/cousins-in-binary-tree/
+ * @level : easy
+ */
+public class LC993_CousinsInBinaryTree {
+	public boolean isCousins(TreeNode root, int x, int y) {
+
+		int[] parents = new int[2];
+		int[] levels = new int[2];
+
+		findParentAndLevel(root, new TreeNode(-1), 0, x, y, parents, levels);
+		return parents[0] != parents[1] && levels[0] == levels[1];
+	}
+
+	private void findParentAndLevel(TreeNode root, TreeNode currParent, int currLevel, int x, int y, int[] parents,
+			int[] levels) {
+
+		if (root == null) {
+			return;
+		}
+
+		if (root.val == x) {
+			parents[0] = currParent.val;
+			levels[0] = currLevel;
+		}
+
+		if (root.val == y) {
+			parents[1] = currParent.val;
+			levels[1] = currLevel;
+		}
+
+		findParentAndLevel(root.left, root, currLevel + 1, x, y, parents, levels);
+		findParentAndLevel(root.right, root, currLevel + 1, x, y, parents, levels);
+		return;
+	}
+}
