initial problem statement:
you will develop a C program to construct a red and black tree. For a given input sequence the tree is unique by using RB-INSERT on one number at a time. Below is an example:
The input is a sequence of numbers separated by comma, e.g. 1,8,11,2, … You can enter the numbers using an input file and output the tree, or through a command line with one number at a time (with “X” to stop entering and printing the output). The output should reflect the above tree in the pre-order traversal, by listing nodes with B and R indicating the black and red colors. In addtion, please also show the height and the black height of the red and black tree, as well as the second largest element on the tree. A sample output is:
Pre-order traversal of the tree:
1-B; 2-R; 5-R; 8-R, 7-B; 11-B; 14-B; 15-R;
The height of the red and black tree is 4.
The black height of the red and black tree is 2.
The second largest element of the tree is 14.
The code is ready but I am facing compilation errors.
10 freelancers are bidding on average ₹2270 for this job
Dear, sir I have already studied your task in detail. I'm an expert in c, algorithm and its data structure. If you ping me, you'll get a good result in a short time. Thanks, sir Waiting for your reply....
this is quite an easy task. In can help you out with all the compilation [login to view URL] the way could you please mention which compiler you are using
I have been working with C ++ for 5 years. There is an experience of olympiad programming. I will help quickly and efficiently, with clear code and comments. I need a review, so I do it cheaply.