Error codes to Trees

Author: icepersi

DataStructure/Trees/Headers/AVLTree.h

@@ -40,7 +40,6 @@ typedef struct AVLTreeNode {
 typedef struct AVLTree {
     AVLTreeNode *root;
     uint32_t nodeCount;
-    uint32_t sizeOfType;
     int (*cmp)(const void *, const void *);
     void    (*freeFn)(void *);
 } AVLTree;
@@ -60,19 +59,19 @@ int32_t AVLTreeIsPresent(AVLTree *avlTree, void *searchKey);
 
 void AVLTreePrint(AVLTreeNode *root, void (printFn)(void *));
 
-AVLTreeNode* AVLInOrderPredecessor(AVLTree *avlTree,AVLTreeNode *referenceNode);
+AVLTreeNode* AVLInOrderPredecessor(AVLTree *avlTree,void *referenceNode);
 
-AVLTreeNode* AVLInOrderSuccessor(AVLTree *avlTree, AVLTreeNode *referenceNode);
+AVLTreeNode* AVLInOrderSuccessor(AVLTree *avlTree, void *referenceNode);
 
 void AVLTreeInsert(AVLTree *avlTree, void *key);
 
-AVLTreeNode *AVLTreeSearch(AVLTree *avlTree, AVLTreeNode *node, char *key);
+AVLTreeNode *AVLTreeSearch(AVLTree *avlTree,  char *key);
 
 void **AVLTreeToArray(AVLTree *avlTree);
 
 void AVLTreeFree(AVLTree* avlTree);
 
-AVLTree *AVLTreeInitialize(int32_t size, int32_t (*cmp)(const void *, const void *), void (*freeFn)(void *));
+AVLTree *AVLTreeInitialize(int (*cmp)(const void *, const void *), void (*freeFn)(void *));
 
 void AVLTreePrintStats(AVLTree *tree);
 

DataStructure/Trees/Headers/BinaryMaxHeap.h

@@ -36,19 +36,19 @@ typedef struct BinaryMaxHeap {
 
 BinaryMaxHeap *MaxHeapInitialize(int32_t (*cmp)(const void *, const void *), void (*freeFn)(void *));
 
-void MaxHeapInsert(BinaryMaxHeap *h, void *value);
+void MaxHeapInsert(BinaryMaxHeap *binaryMaxHeap, void *value);
 
 BinaryMaxHeap *MaxHeapify(void **arr, uint32_t size, int32_t (*cmp)(const void *, const void *));
 
-void printMaxHeap(BinaryMaxHeap *h, void (*printfn)(void *));
+void printMaxHeap(BinaryMaxHeap *binaryMaxHeap, void (*printfn)(void *));
 
-void MaxHeapifyDown(BinaryMaxHeap *h, int32_t index);
+void MaxHeapifyDown(BinaryMaxHeap *binaryMaxHeap, int32_t index);
 
 void MaxHeapPrint(BinaryMaxHeap *MaxHeap, int32_t i, void (*printfn)(void *));
 
-void MaxHeapDelete(BinaryMaxHeap *heap, void **res);
+void MaxHeapDelete(BinaryMaxHeap *binaryMaxHeap, void **res);
 
-void MaxHeapClear(BinaryMaxHeap *pMaxHeap);
+void MaxHeapClear(BinaryMaxHeap *binaryMaxHeap);
 
 void MaxHeapAddAll(BinaryMaxHeap *binaryMaxHeap, void **arr, uint32_t size);
 

DataStructure/Trees/Headers/BinaryMinHeap.h

@@ -35,21 +35,21 @@ typedef struct BinaryMinHeap {
 
 BinaryMinHeap *MinHeapInitialize(int32_t (*cmp)(const void *, const void *), void (*freeFn)(void *));
 
-void MinHeapInsert(BinaryMinHeap *pMinHeap, void *value);
+void MinHeapInsert(BinaryMinHeap *binaryMinHeap, void *value);
 
 BinaryMinHeap *MinHeapify(void *arr, uint32_t size, int32_t (*cmp)(const void *, const void *));
 
-void MinHeapDestroy(BinaryMinHeap *pMinHeap);
+void MinHeapDestroy(BinaryMinHeap *binaryMinHeap);
 
-void printMinHeap(BinaryMinHeap *pMinHeap, void (*printfn)(void *));
+void printMinHeap(BinaryMinHeap *binaryMinHeap, void (*printfn)(void *));
 
-void MinHeapifyDown(BinaryMinHeap *pMinHeap, int index);
+void MinHeapifyDown(BinaryMinHeap *binaryMinHeap, int index);
 
-void MinHeapDelete(BinaryMinHeap *pMinHeap, void **res);
+void MinHeapDelete(BinaryMinHeap *binaryMinHeap, void **res);
 
-void MinHeapAddAll(BinaryMinHeap *pMinHeap, void **arr, uint32_t size);
+void MinHeapAddAll(BinaryMinHeap *binaryMinHeap, void **arr, uint32_t size);
 
-void MinHeapClear(BinaryMinHeap *pMinHeap);
+void MinHeapClear(BinaryMinHeap *binaryMinHeap);
 
 #ifdef __cplusplus
 }

DataStructure/Trees/Headers/BinaryTree.h

@@ -54,9 +54,9 @@ int BinaryTreeIsPresent(BinaryTree *binaryTree, void *searchKey);
 
 void BinaryTreePrint(BinaryTreeNode *root, void (printFn)(void *));
 
-BinaryTreeNode* BinaryTreeInOrderPredecessor(BinaryTree *binaryTree, BinaryTreeNode *referenceNode);
+BinaryTreeNode* BinaryTreeInOrderPredecessor(BinaryTree *binaryTree, void *key);
 
-BinaryTreeNode* BinaryTreeInOrderSuccessor(BinaryTree *binaryTree, BinaryTreeNode *referenceNode);
+BinaryTreeNode* BinaryTreeInOrderSuccessor(BinaryTree *binaryTree, void *key);
 
 void BinaryTreeInsert(BinaryTree *binaryTree, void *key);
 

DataStructure/Trees/Headers/SplayTree.h

@@ -41,7 +41,7 @@ typedef struct SplayTree {
 
 SplayNode *newSplayNode(void *key);
 
-SplayTree *SplayTreeInitialize(int16_t (*cmp)(const void *, const void *));
+SplayTree *SplayTreeInitialize(int16_t (*cmp)(const void *, const void *), void (*freeFn)(void *));
 
 SplayNode *SplayRightRotate(SplayNode *x);
 
@@ -59,9 +59,9 @@ void SplayTreeDeleteWithoutFree(SplayTree* splayTree, void *key);
 
 void freeSplayNode(SplayNode **node, void (*pFunction)(void *));
 
-void SplayTreeFree(SplayNode **root, void (*pFunction)(void *));
+void SplayTreeFree(SplayTree *splayTree);
 
-void printInOrderSplayTree(SplayNode *node, void (printFn)(void *));
+void printInOrderSplayTree(SplayTree *splayTree, void (printFn)(void *));
 
 void printSplayTree(SplayNode *root, void (printFn)(void *));