Hi, I need a c++ code for this question. Sorry that I couldn't upload the .csv file.

1 Red-Black Trees (70 pts) Implementation In this part, you are going to build a basketball player database with Red-Black Tree. The key for each of the nodes should be the corresponding player's name. Point, rebound and assist values should be kept as extra attributes within your nodes. Point, rebound and assist values should be updated for each season accordingly. Your insertion opera- tion should insert a new node into the relevant position in the Red-Black Tree and then recolor and rotate existing nodes in order to meet the constraints and rebalance the tree. At the end of each season you should print all-time point, rebound, and assist leaders. You should use pre-order traversal to recursively print the nodes in red-black tree. The output should properly represent the depth of nodes by indentation as shown in sample run. You should print the tree only at the end of the first season. You must also state whether a node is black (BLACK) or red (RED). You are given euroleague.csv file which contains the information about players. Your code should take filename as an argument. 10 12 Sample Run g++ studentID.cpp -o student ID 2. / studentID sample.csv (or python3 studentID.py sample.csv) End of the 2016-2017 Season Max Points: 386 - Player Name: Ali Muhammed Max Assists: 130 - Player Name: Kostas Sloukas Max Rebs: 241 Player Name: Ekpe Udoh 8(BLACK) Jan Vesely -(BLACK) Baris Hersek -(RED) Ali Muhammed (BLACK) Ahmet Duverioglu (BLACK) Anthony Bennett (RED) Ekpe Udoh (BLACK) Bogdan Bogdanovic (RED) Berk Ugurlu (RED) Egehan Arna -(BLACK) Gigi Datome (RED) James Nunnally (BLACK) Nikola Kalinic (BLACK) Kostas Sloukas -(RED) Melih Mahmutoglu (BLACK) Pero Antic -(RED) Yordan Minchev 24 End of the 2017-2018 Season Max Points: 752 Player Name: Jan Vesely 26 Max Assists: 318 Player Name: Kostas Sloukas Max Rebs : 328 Player Name: Jan Vesely 14 16 18 20 22