From 89a54ae41a03a8f6b3d0ae8e5d45105cbcb15c3b Mon Sep 17 00:00:00 2001
From: orperes1 <53706045+orperes1@users.noreply.github.com>
Date: Sun, 29 Dec 2019 14:45:24 +0200
Subject: [PATCH] Create 872.c

---
 872.c | 43 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 872.c

diff --git a/872.c b/872.c
new file mode 100644
index 00000000..577a3c9f
--- /dev/null
+++ b/872.c
@@ -0,0 +1,43 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     struct TreeNode *left;
+ *     struct TreeNode *right;
+ * };
+ */
+
+
+bool leafSimilar(struct TreeNode* root1, struct TreeNode* root2){
+    int sequence1[100] ={0}, sequence2[100]={0}, num_of_node1 =0,num_of_node2 =0;
+    
+    num_of_node1 = sequence(root1,sequence1,num_of_node1);
+    num_of_node2 = sequence(root2,sequence2,num_of_node2);
+
+    if (num_of_node1 != num_of_node2)
+        return false;
+       
+    for (int i = 0;i<num_of_node1; i++){
+        if (sequence1[i] != sequence2[i])
+            return false;
+    }
+    return true;
+}
+
+
+int sequence(struct TreeNode* root ,int *list , int num_of_node){
+
+    if (!root)
+        return num_of_node;
+    
+    if (!root->left &&  !root->right){
+        list[num_of_node] = root->val;
+        num_of_node ++;
+        return num_of_node;
+    }
+    
+    num_of_node = sequence(root->left ,list , num_of_node);
+    num_of_node = sequence(root->right ,list , num_of_node);
+    
+    return num_of_node; 
+}