Binary Search Tree

Fertiggestellt Veröffentlicht Oct 19, 2014 Bezahlt bei Lieferung
Fertiggestellt Bezahlt bei Lieferung

Read about hundred non-duplicated integers (<100) from input and insert them into a Binary Search Tree one by one. Then print the entire tree on the screen console in consecutive rows such that

(1) Tree is aligned horizontally with the root at column 1 from left and other nodes in right columns according to their depths.

(2) The smallest node comes at the first row and the largest node at the final row. Other nodes are listed in order in consecutive rows, i.e., the nodes are sorted vertically in the print

(3) In front of each node in its row, print a number of "-" corresponding to its depth in the tree. Also, the depth value should be printed in the leftmost column (column 0).

For example: with the input numbers 3, 1, 8, 83, 6, 90, 80 the tree print is

(1) -1

(0) 3

(2) -- 6

(1) - 8

(3) --- 80

(2) -- 83

(3) --- 90

This should be calculated using Hadoop and i need to run the program on linux machine on Amazon Web Services.

Shouldn't take more than a few hours. Need proper comments and explanation. Please contact me if you any questions.

Amazon Web Services C++ Programmierung Hadoop Linux

Projekt-ID: #6611612

Über das Projekt

3 Vorschläge Remote Projekt Aktiv Oct 19, 2014

Vergeben an:

salmanbukhari0

I have read the description and i can code this in few hours. Kindly tell me you want it to be written for linux only? so i should code on GCC Standards or original C standard?

$10 USD in 1 Tag
(0 Bewertungen)
0.0

3 Freelancer bieten im Durchschnitt $20 für diesen Job

cnkei

一个有效的提议尚未被提供

$40 USD in 0 Tagen
(4 Bewertungen)
3.3
s3rg1u

hy i can do it in a very short time, for a small amount of money so please let me know if you are interested in my offer thanks

$10 USD in 1 Tag
(7 Bewertungen)
3.0