CcccC language programing

3. RBT (Red-Black Tree) 1. Program the following functions. a. RB-INSERT(T, z) Do not attach z if it is already in T/ b. RB-DELETECT, 2) 2. Using RB-INSERT(T, z) construct a RBT with the keys in A[201 and print the BST Fill in A[20] by rand()%50. Avoid duplicate values. Execute srand(time(NULL)) first. 3. Execute TREE-INSERT(T, 5), TREE-INSERT(T, 7), TREE-INSERT(T, 17) TREE-INSERT (T, 61), sequentially. PRINT-BST(T), if a key is actually inserted, each time after the insertion is performed. (Check whether the insertions are corrected performed.) If a key is already in T the insertion ignored 4. Execute TREE-DELETE(T, 17), TREE-DELETE(T, 5), TREE-DELETE(T, 51) TREE-DELETE(T, 17) sequentially PRINT-BST(T) each time after the deletion is performed, (Check whether the deletions are corrected performed.) 6. What are the heights of BST and RBT after insertions are made? 3. RBT (Red-Black Tree) 1. Program the following functions. a. RB-INSERT(T, z) Do not attach z if it is already in T/ b. RB-DELETECT, 2) 2. Using RB-INSERT(T, z) construct a RBT with the keys in A[201 and print the BST Fill in A[20] by rand()%50. Avoid duplicate values. Execute srand(time(NULL)) first. 3. Execute TREE-INSERT(T, 5), TREE-INSERT(T, 7), TREE-INSERT(T, 17) TREE-INSERT (T, 61), sequentially. PRINT-BST(T), if a key is actually inserted, each time after the insertion is performed. (Check whether the insertions are corrected performed.) If a key is already in T the insertion ignored 4. Execute TREE-DELETE(T, 17), TREE-DELETE(T, 5), TREE-DELETE(T, 51) TREE-DELETE(T, 17) sequentially PRINT-BST(T) each time after the deletion is performed, (Check whether the deletions are corrected performed.) 6. What are the heights of BST and RBT after insertions are made