Skip to main content

C++ Project - Binary Search Tree Problems, finding height, number of nodes and BST cloning

Binary Search Tree Implementation + Full Documentation

This programming assignment simulates the use and functionality of binary search trees (BST) by comparing statistics over several simulations.


  1. Start the random number generator at the current time stamp -- similar or the same as srand(time(0)).
  2. Initialize variables to be used in the program’s final report.
  3. Define a struct node with four fields: node * left, * right; int data; and int frequency. Frequency means the number of times the specific data value was placed into the tree. So, instead of having a BST with the same data values, count the number of times (more than zero) that the data value was placed into the tree.
  4. Run the following 1000 times:
    • Start with an empty binary search tree.
    • Load 5000 integers with values between 0 and 1023 into the BST.
    • Without changing that tree (Call it T1, here), create another empty BST, say T2 and load all the data from T1 into T2 in such a way that T2 is “balanced.” 
    • Gather the following three data items: Number of nodes in either tree (they will be the same). The average height of each tree.  
    • Make both trees empty.
  5. Write a report on the screen that explains the floating point averages of all the data items gathered in 4. d. 


Note that collaboration is not permitted. If I feel you are using the code you don’t understand, I may question you about the code so that I can be convinced it is your work. Some of the techniques and functions here are similar to those used in class; some are substantially new. There will be plenty of time to ask questions in class to clarify.

What are you waiting for? Get you solution now In just a minute.


Buy now

CONTACT DETAILS

For any other questions or other tasks please feel free to contact me
via email: mhassnainjamil@gmail.com
via WhatsApp: +92-324-7042178
via skype: hassnainjamil1

Comments

Popular posts from this blog

The Zoo Management System - entity relationship diagram & MS Access Database

Zoo Management System - Project Details: You are the employee of a big, worldwide working Zoo Management Company. Your company is responsible for the Zoo management. Your boss thinks it would be a great idea to store all data for each Zoo in a brand new self-developed ZOO Management System. Up to now, the ZOO management company has maps of each ZOO available. Your boss knows that you took a course in introduction on an ERP system, so he asks you if you could help designing such a system. Each ZOO must have the same organizational structure, which should look like this: Each Zoo has a Zoo-Address. Each Zoo has many visitors (Visitor Ticket Process (VTP). Many Zoo-Attractions belong to a Zoo. Module 1: Entity Relationship Diagram Design a ER (entity-relationship) diagram for your ZOO Management System. Use the information provided below with the entities and its attributes. Put the entities in the correct relationship to each other (organizational structure). Module 2: DB Implem...

Human Physiology by Stuart Ira Fox [PDF] (12th edition) free download

Sudoku Game Project in Java with full source code including GUI task

Introduction The purpose of the project is to try in practice the use of recursion and object-oriented program design. Please make sure to read this entire note before starting your work. Pay close attention to the sections on deadlines, deliverables, and exam rules. The problem Your task in this part of the project is to write a solver for Sudoku puzzles. Sudoku puzzles are a kind of crossword puzzles with numbers where the following two conditions have to be met: In each row or column, the nine numbers have to be from the set [1,2,3,4,5,6,7,8,9] and they must all be different.  For each of the nine non-overlapping 3x3 blocks, the nine numbers have to be from the set [1,2,3,4,5,6,7,8,9] and they ust all be different. The following two figures show a Sudoku puzzle and its solution. The input The input of your program, the Sudoku puzzles, is given in text files. More specifically, they are represented as nine lines of nine characters separated by spaces. The characters can be of two...