Answer:
A Red Black Tree is a type of self-balancing(BST) in this tree ,each node is red or black colored. The red black tree meets all the properties of the binary search tree, but some additional properties have been added to a Red Black Tree.
A Red-Black tree's height is O(Logn) where (n is the tree's amount of nodes).
In a red-black tree with black height k
The maximum number of internal nodes is 
.
The smallest possible number is 
.
Answer:
See attached file for complete detailed code.
Explanation:
See attached file.
Answer:
void delete_record(student_record *arr, int &size, int age, string name, double gpa) {
int index = -1;
if (arr != NULL && size > 0) {
for (int i = 0; i < size; ++i) {
if (arr[i].age == age && arr[i].name == name && arr[i].gpa == gpa) {
index = i;
break;
}
}
}
if (index != -1) {
for (int i = index; i < size - 1; ++i) {
arr[i] = arr[i + 1];
}
size--;
}
}
