Write a simple java program with binary search tree

This project was successfully completed by JinTaiZhe for $20 USD in a day.

Get free quotes for a project like this
Employer working
Project Budget
$10 - $30 USD
Completed In
1 day
Total Bids
Project Description

Write a program that performs the following:

Store integer keys in an initially empty binary search tree. An integer key can appear more than once, but each key must be inserted only once in the tree. If a key appears more than once, a count is kept of how many times it occurred in the input. The binary search tree is implemented using an array from locations 1 to N. Location 0 contains N – the number of keys in the binary search tree.

Display (and implement) a menu of commands as follows:

P – print a list of keys in ascending order and their frequency

I – insert a key(supplied by user) into the tree

D – deletes a key(supplied by user) from the tree

W – displays the weight of the tree

L – print a list of keys in the tree using a level-order traversal

Q – end the program

I NEED IN 5 HOURS. 10$ is Max budget

Looking to make some money?

  • Set your budget and the timeframe
  • Outline your proposal
  • Get paid for your work

Hire Freelancers who also bid on this project

    • Forbes
    • The New York Times
    • Time
    • Wall Street Journal
    • Times Online