Maurice Tutor

(5)

$15/per page/Negotiable

About Maurice Tutor

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:
Algebra,Applied Sciences See all
Algebra,Applied Sciences,Biology,Calculus,Chemistry,Economics,English,Essay writing,Geography,Geology,Health & Medical,Physics,Science Hide all
Teaching Since: May 2017
Last Sign in: 398 Weeks Ago, 1 Day Ago
Questions Answered: 66690
Tutorials Posted: 66688

Education

  • MCS,PHD
    Argosy University/ Phoniex University/
    Nov-2005 - Oct-2011

Experience

  • Professor
    Phoniex University
    Oct-2001 - Nov-2016

Category > Computer Science Posted 15 Sep 2017 My Price 10.00

build a binary search tree

In C++ build a binary search tree, using links (not an array) for 15 records. The data in these records will hold names and their associated weights. Read the data from the screen.

 

Required functionality (Each # should be separate methods):

 

1) Build the tree from the unique set of names (names are the key value) and their associated weights.

 

2) Execute a preorder traversal

 

Execute an inorder traversal

 

3) Execute a postorder traversal

 

4) Find and print the height of the tree using recursion, do not add a height variable to the tree structure, the algorithm stack should hold this.

 

Determine the number of leaves and print the result (remember a leaf has no children).

 

5) Implement search functionality that will search for a name and indicate the weight for that individual if they exist in the structure, otherwise stating no match exists.

 

6) Determine the lowest weight contained in the tree.

 

7) Find the first name in alphabetical order (this should not go through every node, unless the tree happens to be a linked list).

 

Make sure it follows all the details and runs without error for points. Below is an example tree...

 

Image for In C++ build a binary search tree, using links (not an array) for 15 records. The data in these records will h

Show transcribed image text In C++ build a binary search tree, using links (not an array) for 15 records. The data in these records will hold names and their associated weights. Read the data from the screen. Required functionality (Each # should be separate methods): 1) Build the tree from the unique set of names (names are the key value) and their associated weights. 2) Execute a preorder traversal Execute an inorder traversal 3) Execute a postorder traversal 4) Find and print the height of the tree using recursion, do not add a height variable to the tree structure, the algorithm stack should hold this. Determine the number of leaves and print the result (remember a leaf has no children). 5) Implement search functionality that will search for a name and indicate the weight for that individual if they exist in the structure, otherwise stating no match exists. 6) Determine the lowest weight contained in the tree. 7) Find the first name in alphabetical order (this should not go through every node, unless the tree happens to be a linked list). Make sure it follows all the details and runs without error for points. Below is an example tree...

Answers

Maurice Tutor
(5)
Status NEW Posted 15 Sep 2017 01:09 PM My Price 10.00

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------and----------- ac-----------qui-----------sit-----------ion----------- of----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n.P-----------lea-----------se -----------pin-----------g m-----------e o-----------n c-----------hat----------- I -----------am -----------onl-----------ine----------- or----------- in-----------box----------- me----------- a -----------mes-----------sag-----------e I----------- wi-----------ll

Not Rated(0)