From 1b945f6270d7439c1032a1b011ebb5d1b8706ca0 Mon Sep 17 00:00:00 2001
From: Alisher Togayev <38793933+Alisherka7@users.noreply.github.com>
Date: Thu, 24 Oct 2024 23:57:51 +0900
Subject: [PATCH] Create README.md

---
 951. Flip Equivalent Binary Trees/README.md | 37 +++++++++++++++++++++
 1 file changed, 37 insertions(+)
 create mode 100644 951. Flip Equivalent Binary Trees/README.md

diff --git a/951. Flip Equivalent Binary Trees/README.md b/951. Flip Equivalent Binary Trees/README.md
new file mode 100644
index 0000000..dc6f0dc
--- /dev/null
+++ b/951. Flip Equivalent Binary Trees/README.md	
@@ -0,0 +1,37 @@
+# 951. Flip Equivalent Binary Trees
+
+For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.
+
+A binary tree `X` is flip equivalent to a binary tree Y if and only if we can make X equal to Y after some number of flip operations.
+
+Given the roots of two binary trees root1 and root2, return true if the two trees are flip equivalent or false otherwise.
+
+ 
+
+### Example 1:
+
+![Screenshot 2024-10-24 at 11 57 43 PM](https://github.com/user-attachments/assets/2357f93d-ea9f-4ddd-aa2b-d9ce4aa7ce04)
+
+
+```
+Flipped Trees Diagram
+Input: root1 = [1,2,3,4,5,6,null,null,null,7,8], root2 = [1,3,2,null,6,4,5,null,null,null,null,8,7]
+Output: true
+Explanation: We flipped at nodes with values 1, 3, and 5.
+```
+### Example 2:
+```
+Input: root1 = [], root2 = []
+Output: true
+```
+### Example 3:
+```
+Input: root1 = [], root2 = [1]
+Output: false
+```
+
+### Constraints:
+```
+The number of nodes in each tree is in the range [0, 100].
+Each tree will have unique node values in the range [0, 99].
+```