Built a Red Black with constraints of optimazation
$30-250 USD
Paid on delivery
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 ID’s 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. You are not allowed to use TreeMap in Java and std::map in C++.
Project ID: #9935218
About the project
10 freelancers are bidding on average $106 for this job
Hello I am Java and Algorithm expert and interested in this project. I have reviewed your requirements and confident to handle this project perfectly. I also have a lot of experience in helping students with assignme More
Hi there! I have read what you exactly need, however I would like to ask you a few questions. I would call myself a master of what I do, I do work smart and do not rest until I get the job done. Please feel free to pin More
We are expert in Java and J2EE technologies and have completed numerous projects and assignments. We have a total experience of more than eleven years in Java. Our skills and some of our completed projects can be seen More
Greetings, I've authored books on Java, C++ and Data Structures, and have over 10 years of professional experience as a software engineer and consultant. I think this program can be done within 2 days, as it will requi More
