Problem description

You are to implement an event counter using red-black tree. Each event has two fields: ID and count, where count is the number of active events with the given ID. The event counter stores only those IDs whose count is > 0. Once a count drops below 1, that ID is removed. Initially, your program must build red-black tree from a sorted list of n events (i.e., n pairs (ID, count) in ascending order of ID) in O(n) time. Your counter should support the following operations in the specified time complexity.

  • Increase(theID, m) Increase the count of the event theID by m. If theID is not present, insert it. Print the count of theID after the addition. O(log n)
  • Reduce(theID, m) Decrease the count of theID by m. If theIDs count becomes less than or equal to 0, remove theID from the counter. Print the count of theID after the deletion, or 0 if theID is removed or not present. O(log n)
  • Count(theID) Print the count of theID. If not present, print 0. O(log n)
  • InRange(ID1, ID2) Print the total count for IDs between ID1 and ID2 inclusively. Note, ID1 ID2 O(log n + s) where s is the number of IDs in the range.
  • Next(theID) Print the ID and the count of the event with the lowest ID that is greater that theID. Print 0 0, if there is no next ID. O(log n)
  • Previous(theID) Print the ID and the count of the event with the greatest key that is less that theID. Print 0 0, if there is no previous ID. O(log n)

Input/Output Requirements

You may implement this assignment in Java or C++. Your program must be compilable and runable on the Thunder CISE server using gcc/g++ or standard JDK. You may access the server using Telnet or SSH client on thunder.cise.ufl.edu.

You must write a makefile document which creates an executable. The names of your executable must be bbst.

Your program has to support redirected input from a file "file-name" which contains the initial sorted list. The command line for this mode is as follows for C++ and Java respectively:

$bbst file-name
$java bbst file-name

Input format

n
ID1 count1
ID2 count2
...
IDn countn

Assume that IDi < IDi+1 where IDi and counti are positive integers and the total count fits in 4-byte integer limits.

Interactive part

Read the commands from the standard input stream and print the output to the standard output stream. Use the command specifications described in part 1 with all lower cases. The command and the arguments are separated by a space, not parenthesis or commas (i.e inrange 3 5 instead of InRange(3, 5) ). At the end of each command, there will be an EOL character. For each command, print the specified output in the table. Use one space if more than one numbers are printed. Print an EOL character at the end of each command.

Academic Honesty!
It is not our intention to break the school's academic policy. Projects posted are only used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly fill out the form. Please provide a valid email address and we'll get back to you in less than 24 hours. We will be sending an invoice through PayPal upon confirmation. We are a non profit organization however we need an amount to keep this organization running, and to be able to complete our research and development.