Splay Tree and Binary Tree isEqual

Author: icepersi

DataStructure/Trees/Sources/AVLTree.c

@@ -858,4 +858,49 @@ AVLTreeNode* AVLInOrderSuccessor(AVLTree *avlTree, void *referenceNode){
     AVLTreeNode * leftMost  = malloc(sizeof(*leftMost));
     AVLTreeInOrderSuccessorWrapper(avlTree, avlTree->root,referenceNode,&leftMost);
     return leftMost;
-}
+}
+
+void isEqualHelper(AVLTreeNode* node1,AVLTreeNode* node2,int (*cmpFn)(const void *, const void *), int * flag){
+    if (cmpFn == NULL) {
+        fprintf(stderr, INVALID_ARG_MESSAGE, "cmpFn", "isEqualHelper");
+        #ifdef CU_TEST_H
+                DUMMY_TEST_DATASTRUCTURE->errorCode = INVALID_ARG;
+        #else
+                exit(INVALID_ARG);
+        #endif
+    }
+    if(!flag) return;
+    if (node1 == NULL || node2 ==NULL) return;
+    isEqualHelper(node1->right, node2->right,cmpFn,flag);
+    if(!(cmpFn)(node1->key,node2->key)) *flag = 1;
+    isEqualHelper(node1->left, node2->right, cmpFn,flag);
+}
+
+uint32_t isEqual(AVLTree *avlTree,AVLTree *avlTree2){
+    if (avlTree == NULL) {
+        fprintf(stderr, INVALID_ARG_MESSAGE, "avlTree", "isEqual");
+        #ifdef CU_TEST_H
+                DUMMY_TEST_DATASTRUCTURE->errorCode = INVALID_ARG;
+        #else
+                exit(INVALID_ARG);
+        #endif
+
+    }
+
+    if (avlTree2 == NULL) {
+        fprintf(stderr, INVALID_ARG_MESSAGE, "avlTree2", "isEqual");
+        #ifdef CU_TEST_H
+                DUMMY_TEST_DATASTRUCTURE->errorCode = INVALID_ARG;
+        #else
+                exit(INVALID_ARG);
+        #endif
+    }
+
+    if(avlTree->nodeCount < avlTree2->nodeCount) return -1;
+    if(avlTree->nodeCount > avlTree2->nodeCount) return  1;
+    else {
+        uint32_t areEqual = 0;
+        isEqualHelper(avlTree->root,avlTree2->root,avlTree->cmp, &areEqual);
+        return areEqual;
+    }
+}

DataStructure/Trees/Sources/BinaryTree.c

@@ -705,5 +705,51 @@ void BinaryTreeInsert(BinaryTree *binaryTree, void *key){
 
     }
     binaryTree->root = binaryTreeInsertWrapper(binaryTree,binaryTree->root,key);
+}
+
+
 
+void isEqualHelper(BinaryTreeNode* node1,BinaryTreeNode* node2,int (*cmpFn)(const void *, const void *), int * flag){
+    if (cmpFn == NULL) {
+        fprintf(stderr, INVALID_ARG_MESSAGE, "cmpFn", "isEqualHelper");
+        #ifdef CU_TEST_H
+                DUMMY_TEST_DATASTRUCTURE->errorCode = INVALID_ARG;
+        #else
+                exit(INVALID_ARG);
+        #endif
+    }
+    if(!flag) return;
+    if (node1 == NULL || node2 ==NULL) return;
+    isEqualHelper(node1->right, node2->right,cmpFn,flag);
+    if(!(cmpFn)(node1->key,node2->key)) *flag = 1;
+    isEqualHelper(node1->left, node2->right, cmpFn,flag);
+}
+
+uint32_t isEqual(BinaryTree *binaryTree,BinaryTree *binaryTree2){
+    if (binaryTree == NULL) {
+        fprintf(stderr, INVALID_ARG_MESSAGE, "binaryTree", "isEqual");
+        #ifdef CU_TEST_H
+                DUMMY_TEST_DATASTRUCTURE->errorCode = INVALID_ARG;
+        #else
+                exit(INVALID_ARG);
+        #endif
+
+    }
+
+    if (binaryTree2 == NULL) {
+        fprintf(stderr, INVALID_ARG_MESSAGE, "binaryTree2", "isEqual");
+        #ifdef CU_TEST_H
+                DUMMY_TEST_DATASTRUCTURE->errorCode = INVALID_ARG;
+        #else
+                exit(INVALID_ARG);
+        #endif
+    }
+
+    if(binaryTree->nodeCount < binaryTree2->nodeCount) return -1;
+    if(binaryTree->nodeCount > binaryTree2->nodeCount) return  1;
+    else {
+        uint32_t areEqual = 0;
+        isEqualHelper(binaryTree->root,binaryTree2->root,binaryTree->cmp, &areEqual);
+        return areEqual;
+    }
 }

DataStructure/Trees/Sources/SplayTree.c

@@ -487,3 +487,54 @@ void SplayTreeToArrayRecurs(SplayNode* node , void **arr, int *i){
     *i += 1;
     SplayTreeToArrayRecurs(node->right, arr, i);
 }
+
+///
+/// \param node1
+/// \param node2
+/// \param cmpFn
+/// \param flag
+void isEqualHelper(SplayNode* node1,SplayNode* node2,int (*cmpFn)(const void *, const void *), int * flag){
+    if (cmpFn == NULL) {
+        fprintf(stderr, INVALID_ARG_MESSAGE, "cmpFn", "isEqualHelper");
+        #ifdef CU_TEST_H
+                DUMMY_TEST_DATASTRUCTURE->errorCode = INVALID_ARG;
+        #else
+                exit(INVALID_ARG);
+        #endif
+    }
+    if(!flag) return;
+    if (node1 == NULL || node2 ==NULL) return;
+    isEqualHelper(node1->right, node2->right,cmpFn,flag);
+    if(!(cmpFn)(node1->key,node2->key)) *flag = 1;
+    isEqualHelper(node1->left, node2->right, cmpFn,flag);
+}
+
+
+
+uint32_t isEqual(SplayTree *splayTree, SplayTree *splayTree2){
+    if (splayTree == NULL) {
+        fprintf(stderr, INVALID_ARG_MESSAGE, "splayTree", "isEqual");
+        #ifdef CU_TEST_H
+                DUMMY_TEST_DATASTRUCTURE->errorCode = INVALID_ARG;
+        #else
+                exit(INVALID_ARG);
+        #endif
+    }
+
+    if (splayTree2 == NULL) {
+        fprintf(stderr, INVALID_ARG_MESSAGE, "splayTree2", "isEqual");
+        #ifdef CU_TEST_H
+                DUMMY_TEST_DATASTRUCTURE->errorCode = INVALID_ARG;
+        #else
+                exit(INVALID_ARG);
+        #endif
+    }
+
+    if(splayTree->nodeCount < splayTree2->nodeCount) return -1;
+    if(splayTree->nodeCount > splayTree2->nodeCount) return  1;
+    else {
+        uint32_t areEqual = 0;
+        isEqualHelper(splayTree->root, splayTree2->root, splayTree->cmp, &areEqual);
+        return areEqual;
+    }
+}