Write an implementation of red-black trees. The keys should be strings. Test the insert, delete, and search functions. For testing purposes you will need some routine to display or print a red-black tree. Your display does not have to be as fancy as the demo shown in class. Modify the fields in the red-black tree so that each node also stores the number of nodes in its subtree (including itself). You will have to add code to Left-Rotate and to Right-Rotate to maintain these counts. . Write a function that returns the ith node of the tree. Your function should run in O(logn) time.
i need the code on thrusday and it should run in vc++.make sure the code runs on vc++.