Concluído

Code

Implement a minimum binary heap class using an array instead of a dynamic allocation approach. The public section of your class must contain: constructor, destructor, enqueue, dequeue, isEmpty, isFull plus any other functions necessary to complete the tasks below. You must add traversal methods either to the public section or by implementing them as ("free") application functions. You need to include the definition of a BinaryNode class to fit your implementation. Write a driver program to demonstrate that your class works. The driver program should: 1. Create a heap by inserting the following data into an initially empty tree: 50, 25, 80, 20, 35, 70, 90, 23, 65, 100, 75, 30, 15, 68, 5,150, 18, 95 2. Print the array that holds the heap. 3. Insert 29 into the heap. 4. Print the array that holds the heap. 5. Dequeue an element from the heap 6. Print the heap nodes in the order visited by a postorder traversal 7. Dequeue an element from the heap. 8. Print the heap nodes in the order visited by a preorder traversal 9. Dequeue an element from the heap. 10. Print the heap nodes in the order visited by an inorder traversal 11. Dequeue an element from the heap. 12. Print the array that holds the heap. When printing the heap, print the values horizontally to save space (and paper!). Be sure to comment your code in a clear and consistent manner.

## 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) Complete ownership and distribution copyrights to all work purchased.

## Platform

Visual Studio C++

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

Veja mais: write programming code, tree programming, tree insert, studio 9 plus, public programming, programming tree, programming definition, programming class definition, php visual studio free, order of tree, order of binary tree, insert in binary tree, heap programming, free programming code, free code, dynamic programming software, dynamic programming definition, dynamic programming code, dynamic programming approach, definition of programming

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

ID do Projeto: #2885452

Concedido a:

musharrafvw

See private message.

$2 USD em 14 dias
(54 Comentários)
5.3

23 freelancers estão ofertando em média $19 para esse trabalho

florentin

See private message.

$17 USD in 14 dias
(105 Comentários)
7.7
softdreamsvw

See private message.

$8.5 USD in 14 dias
(55 Comentários)
7.1
idleswell

See private message.

$17 USD in 14 dias
(170 Comentários)
5.8
cinterosystems

See private message.

$17 USD in 14 dias
(139 Comentários)
5.6
sanatanvw

See private message.

$51 USD in 14 dias
(72 Comentários)
5.5
vw139994vw

See private message.

$25.5 USD in 14 dias
(60 Comentários)
4.5
emesevw

See private message.

$4.63 USD in 14 dias
(111 Comentários)
4.4
lalesculiviu

See private message.

$38.25 USD in 14 dias
(18 Comentários)
4.2
jaffersonso

See private message.

$10.2 USD in 14 dias
(16 Comentários)
3.9
vw450309vw

See private message.

$4.25 USD in 14 dias
(17 Comentários)
3.8
ioikmn

See private message.

$17 USD in 14 dias
(14 Comentários)
3.7
vw627017vw

See private message.

$11.05 USD in 14 dias
(24 Comentários)
3.5
vw174684vw

See private message.

$8.5 USD in 14 dias
(11 Comentários)
3.1
sfunds

See private message.

$17 USD in 14 dias
(5 Comentários)
2.9
stmpeters

See private message.

$12.75 USD in 14 dias
(20 Comentários)
2.7
kandycomput

See private message.

$15.3 USD in 14 dias
(16 Comentários)
2.5
ndnvw

See private message.

$8.5 USD in 14 dias
(3 Comentários)
2.1
dmruttka

See private message.

$17 USD in 14 dias
(1 Comentário)
0.0
omdavw

See private message.

$29.75 USD in 14 dias
(1 Comentário)
0.0
xelis

See private message.

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