Edited documintation and moved the error messages to the else condition in Red Black Tree data structure.

Author: MostafaTwfiq

DataStructure/Trees/Headers/RedBlackTree.h

@@ -5,11 +5,30 @@
 extern "C" {
 #endif
 
+
+
 typedef enum COLOR {
     RED,
     BLACK
 } COLOR;
 
+
+
+
+/** @struct RBNode
+*  @brief This structure implements a basic RED BLACK Tree node.
+*  @var RBNode::key
+*  Member 'key' is a pointer to the node value.
+*  @var RBNode::color
+*  Member 'color' hold the current color of the node.
+*  @var RBNode::left
+*  Member 'left' is a pointer to the left node.
+*  @var RBNode::right
+*  Member 'right' is a pointer to the right node.
+*  @var RBNode::parent
+*  Member 'parent' is a pointer to the parent node.
+*/
+
 typedef struct RBNode {
     void *key;
     COLOR color;
@@ -18,6 +37,20 @@ typedef struct RBNode {
     struct RBNode *parent;
 } RBNode;
 
+
+
+/** @struct RBTree
+*  @brief This structure implements a basic generic RED BLACK Tree.
+*  @var RBTree::root
+*  Member 'root' is a pointer to the root node.
+*  @var RBTree::nodeCount
+*  Member 'nodeCount' hold the current number of nodes.
+*  @var RBTree::freeItem
+*  Member 'freeItem' is a pointer to the free function, that will be called to free the tree values.
+*  @var RBTree::cmp
+*  Member 'cmp' is a pointer to the comparator function, that will be called to compare the tree values.
+*/
+
 typedef struct RBTree {
     struct RBNode *root;
     int nodeCount;