Rename Red Black Tree (Insertion and Deletion operation).cpp to red_black_tree_insertion_and_deletion.cpp

Author: HitainKakkar

Data Structures/Trees/Red Black Tree (Insertion and Deletion operation).cpp renamed to Data Structures/Trees/red_black_tree_insertion_and_deletion.cpp

@@ -86,7 +86,7 @@ class RBTree {
 				} 
 				else {
 					if (s->right->color == 0) {
-						// x ’s sibling S is black, S's left child is red, and S's right child is black.
+						// x ’s sibling S is black, S's left child is red, and S's right child is black.
 						s->left->color = 0;
 						s->color = 1;
 						rightRotate(s);
@@ -119,7 +119,7 @@ class RBTree {
 				} 
 				else {
 					if (s->left->color == 0) {
-						// x ’s sibling S is black, S's left child is red, and S's right child is black.
+						// x ’s sibling S is black, S's left child is red, and S's right child is black.
 						s->right->color = 0;
 						s->color = 1;
 						leftRotate(s);
@@ -688,4 +688,4 @@ Time Complexity for Printing the tree : O(n), where n is the number of nodes in
 Time Complexity for the functions rightRotate and leftRotate : O(1) ; since the rotation is at a single node
 Space Complexity for Insertion in the Red Black Tree tree : O(n), where n is the number of nodes in the tree
 Space Complexity for Deletion in the Red Black Tree tree : O(n), where n is the number of nodes in the tree
-*/
+*/