Reference no: EM132169213
USING JAVA:
You are to create a red-black tree which supports only the operations listed below. All operations should have time complexity O(log n) when there are n items in the tree, this is the guarantee that red-black trees give. The class should be derived from the TreeMap class in java.util
The only operations which this class supports are:
public boolean is Empty()
public void makeEmpty()
public void insert(Comparable x) throws DuplicateItem
public void delete(Comparable x) throws ItemNotFound
public void deleteMin() throws ItemNotFound
public void deleteMax() throws ItemNotFound
public Object find(Comparable x) throws ItemNotFound
public Object findMin() throws ItemNotFound
public Object findMax() throws ItemNotFound
Your class should be named RBTree
Notes
In no particular order
TreeMap expects Object and the requirement for RBTree is Comparable
TreeMap doesn't throw any reasonable checked exceptions. Your RBTree class does.
TreeMap expects to perform a mapping of keys to data. RBTree doesn't. You may find this to present a problem if you're not careful in the way you implement some of the methods.
The methods in the above list are the only methods that RBTree supports.
Allow the user to toggle a checkbox for case sensitivity
: Using HTML, CSS, and JavaScript, Input a user-specified text file (i.e., one with suffix .txt) and display it in a scrollable textbox.
|
Create a comparison spreadsheet to compare the systems
: Create a comparison spreadsheet to compare the different systems. Compare at least 5 different IDPS. Be sure and state the source of your information.
|
Create an order form for the three items you used
: Provide at least the choices Visa, MasterCard and American Express. Each form element, not just payment, must have an associated element.
|
Draw your initials 100 pixels high
: Draw a rectangle as a Rectangle and as a Polygon. Make the lines of the Polygon yellow and the lines of the Rectangle green.
|
Create a red-black tree which supports only the operations
: Create a red-black tree which supports only the operations listed below. All operations should have time complexity O(n).
|
Write some code that asks the user to enter an integer
: Write some code that asks the user to enter an integer via the keyboard, use that integer to set the length of an array.
|
Write an application that creates objects of each
: Using interfaces, as you learned in this chapter, you can specify similar behaviors for possibly disparate classes.
|
Create a gui application that allows the user to enter
: Create a GUI application that allows the user to enter the total sales for the month into a text field.
|
Create a personal set of web pages on any topic
: Create a personal set of Web pages on any topic that you like. Use CSS to provide a consistent style to your pages.
|