Binary Tree
$30-5000 USD
Completed
Posted almost 20 years ago
$30-5000 USD
Paid on delivery
Write recursive procedures to perform the following operations on a binary trees (the data type of the nodes is int) Compute the height of a tree Find the maximum element Find the sum of the elements Write a program to test the procedures Note that this a general binary tree, not a binary search tree ordering of the elements is not important.
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
## Platform
Borland C++ Version 5.02
Project ID: 3281647
About the project
34 proposals
Remote project
Active 20 yrs ago
Looking to make some money?
Benefits of bidding on Freelancer
Set your budget and timeframe
Get paid for your work
Outline your proposal
It's free to sign up and bid on jobs
1.4
1.4
34 freelancers are bidding on average $17 USD for this job
6.0
6.0
5.7
5.7
5.2
5.2
5.1
5.1
5.0
5.0
4.7
4.7
4.1
4.1
3.5
3.5
3.5
3.5
4.4
4.4
4.1
4.1
2.7
2.7
2.9
2.9
2.7
2.7
2.2
2.2
1.5
1.5
0.9
0.9
1.1
1.1
0.0
0.0
0.0
0.0
About the client
Louisville, United States
32
Member since Jul 12, 2003
Client Verification
Other jobs from this client
$30-5000 USD
$30-5000 USD
$30-5000 USD
$30-5000 USD
$30-5000 USD
Similar jobs
₹12500-37500 INR
$8-15 USD / hour
$30-250 USD
$30-250 USD
$10-30 USD
$10-30 USD
₹12500-37500 INR
€2-6 EUR / hour
$1250 USD
$10-11 USD
$1500-3000 NZD
$250-750 USD
₹12500-37500 INR
€8-30 EUR
₹1500-12500 INR
₹12500-37500 INR
$250-750 USD
$30-250 CAD
$250-750 USD
$250-750 USD
Thanks! We’ve emailed you a link to claim your free credit.
Something went wrong while sending your email. Please try again.
Copy to clipboard failed, please try again after adjusting your permissions.
Copied to clipboard.
Loading preview
Permission granted for Geolocation.
Your login session has expired and you have been logged out. Please log in again.