Em Andamento

AVL tree

Download code for the AVL tree and then add the following:

1. A function that tests any arbitrary binary tree to see if it is a valid AVL tree, i.e. if it is a binary search tree with the AVL property. All nodes should have height set to zero initially. The function should set heights to the correct values as it checks the tree.

2. A nonrecursive version of the insert function.

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.

2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.

3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).

I'll provide the stl source that you might need including AVL tree code.

1. Programs must be written C++.

2. Follow the programming style illustrated in the text. In particular:

1. Divide your program into header (.h) files giving interface information and implementation (.cpp) files showing details.

2. Comment your code thoroughly.

3. Indent and use blank lines to emphasize structure and enhance readability.

3. Programs will be evaluated on validity, efficiency, modularity, clarity and also on the quality of the external interface--ease of use, output formatting, etc.

4. Program submissions must be made in laser-quality format. In each case, submit the following, in this order:

1. A cover sheet with your name and a brief, typed summary of results.

2. Commented sample runs.

3. Source code: main program, followed by header files, followed by implementation files. Be sure file names are noted at the top of each page.

## Platform

windows 95, 98, 2000, ME, XP

Habilidades: Programação C, Engenharia, MySQL, PHP, Arquitetura de software, Teste de Software

Ver mais: use of binary search tree, tree structure programming, tree structure in c, tree programming, tree insert, tree in order, tree binary search, the stl, stl set, stl search, stl sample, stl programs, stl programming, stl insert, stl in cpp, stl in c, stl function, stl code, stl binary tree, stl 2, source code for binary search in c, set stl, search in tree, search in binary tree, search binary tree

Acerca do Empregador:
( 2 comentários ) United States

ID do Projeto: #2978594

Premiar a:

shahizanvw

See private message.

$12 USD em 7 dias
(46 Avaliações)
4.6

14 freelancers estão ofertando em média $17 para este trabalho

mihaiscortaru

See private message.

$25.25 USD in 7 dias
(158 Comentários)
6.0
utopiaprogr

See private message.

$17 USD in 7 dias
(61 Comentários)
5.4
projetcoder

See private message.

$25.5 USD in 7 dias
(39 Comentários)
5.0
esegura

See private message.

$17 USD in 7 dias
(22 Comentários)
4.8
vw821235vw

See private message.

$19.55 USD in 7 dias
(92 Comentários)
4.3
lalesculiviu

See private message.

$25.5 USD in 7 dias
(17 Comentários)
4.0
teamvw

See private message.

$17 USD in 7 dias
(36 Comentários)
3.8
shashikhanvw

See private message.

$21.25 USD in 7 dias
(15 Comentários)
3.8
dmitrynaumov

See private message.

$6.8 USD in 7 dias
(9 Comentários)
2.9
gurux

See private message.

$17 USD in 7 dias
(4 Comentários)
2.7
vw966435vw

See private message.

$4.25 USD in 7 dias
(11 Comentários)
2.4
mrjusz

See private message.

$16.15 USD in 7 dias
(0 Comentários)
0.0
codefm

See private message.

$12.75 USD in 7 dias
(0 Comentários)
0.0